A note on decision versus search for graph automorphism

DOI10.1006/INCO.1996.0097zbMATH Open0876.68079OpenAlexW2001700786MaRDI QIDQ675067FDOQ675067

Authors: Vikraman Arvind, Manindra Agrawal 

Publication date: 12 November 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0097

Recommendations

• scientific article; zbMATH DE number 1302030
• scientific article; zbMATH DE number 1136076
• The complexity of modular graph automorphism

zbMATH Keywords

graph isomorphism problemself-computability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (6)

• On the reducibility of sets inside NP to sets with low information content
• Novel techniques to speed up the computation of the automorphism group of a graph
• Computational complexity of computing a partial solution for the graph automorphism problems
• Conflict Anticipation in the Search for Graph Automorphisms
• Relating Complete and Partial Solution for Problems Similar to Graph Automorphism
• Some natural decision problems in automatic graphs

This page was built for publication: A note on decision versus search for graph automorphism

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