[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/gbrpr/CuissartH05>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Bertrand_Cuissart>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jean-Jacques_H%E2%88%9A%C2%A9brard>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-31988-7%5F15>
foaf:homepage <https://doi.org/10.1007/978-3-540-31988-7_15>
dc:identifier DBLP conf/gbrpr/CuissartH05 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-31988-7%5F15 (xsd:string)
dcterms:issued 2005 (xsd:gYear)
rdfs:label A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Bertrand_Cuissart>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jean-Jacques_H%E2%88%9A%C2%A9brard>
swrc:pages 162-171 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/gbrpr/2005>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/gbrpr/CuissartH05/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/gbrpr/CuissartH05>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/gbrpr/gbrpr2005.html#CuissartH05>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-31988-7_15>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/gbrpr>
dc:title A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document