[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/stacs/GuptaN96>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Arvind_Gupta>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Naomi_Nishimura>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-60922-9%5F37>
foaf:homepage <https://doi.org/10.1007/3-540-60922-9_37>
dc:identifier DBLP conf/stacs/GuptaN96 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-60922-9%5F37 (xsd:string)
dcterms:issued 1996 (xsd:gYear)
rdfs:label Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Arvind_Gupta>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Naomi_Nishimura>
swrc:pages 453-464 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/stacs/1996>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/stacs/GuptaN96/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/stacs/GuptaN96>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/stacs/stacs96.html#GuptaN96>
rdfs:seeAlso <https://doi.org/10.1007/3-540-60922-9_37>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/stacs>
dc:title Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document