A note on decision versus search for graph automorphism

DOI10.1006/inco.1996.0097zbMath0876.68079OpenAlexW2001700786MaRDI QIDQ675067

V. 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)

Related Items (2)

On the reducibility of sets inside NP to sets with low information content ⋮ Computational complexity of computing a partial solution for the graph automorphism problems

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