Relating Complete and Partial Solution for Problems Similar to Graph Automorphism

DOI10.1007/978-3-540-74456-6_52MaRDI QIDQ3525603zbMATH OpenOpenAlexFDO

Authors Takayuki Nagoya, Seinosuke Toda

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74456-6_52

zbMATH Keywords

computational complexitygraph automorphismpartial solutionreducibility

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing graph automorphism from partial solutions
• Computational complexity of computing a partial solution for the graph automorphism problems
• A note on decision versus search for graph automorphism
• The complexity of modular graph automorphism
• scientific article; zbMATH DE number 1302030

Cited in

(2)

• Computational complexity of computing a partial solution for the graph automorphism problems
• Computing graph automorphism from partial solutions

This page was built for publication: Relating Complete and Partial Solution for Problems Similar to Graph Automorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525603)