A note on decision versus search for graph automorphism

DOI10.1006/INCO.1996.0097MaRDI QIDQ675067zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cited in

(6)

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

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)