Computing Graph Automorphism from Partial Solutions. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/mst/Nagoya09>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Takayuki_Nagoya>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2Fs00224-007-9077-7>
foaf:homepage	<https://doi.org/10.1007/s00224-007-9077-7>
dc:identifier	DBLP journals/mst/Nagoya09 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2Fs00224-007-9077-7 (xsd:string)
dcterms:issued	2009 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/mst>
rdfs:label	Computing Graph Automorphism from Partial Solutions. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Takayuki_Nagoya>
swrc:number	3 (xsd:string)
swrc:pages	356-368 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/mst/Nagoya09/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/mst/Nagoya09>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/mst/mst44.html#Nagoya09>
rdfs:seeAlso	<https://doi.org/10.1007/s00224-007-9077-7>
dc:subject	Computational complexity; Partial solution; Graph automorphism (xsd:string)
dc:title	Computing Graph Automorphism from Partial Solutions. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	44 (xsd:string)