Computing graph automorphism from partial solutions

DOI10.1007/s00224-007-9077-7zbMath1176.68085OpenAlexW1989311466MaRDI QIDQ2272212

Takayuki Nagoya

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9077-7

zbMATH Keywords

computational complexitygraph automorphismpartial solution

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Computational complexity of computing a partial solution for the graph automorphism problems

Cites Work

• Unnamed Item
• Unnamed Item
• Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
• Some NP-Complete Problems Similar to Graph Isomorphism
• The graph isomorphism disease

This page was built for publication: Computing graph automorphism from partial solutions