A Note on Decision versus Search for Graph Automorphism


We show that for any graph G, k nontrivial automorphisms of G if as many exist can be computed in time |G| k) with nonadaptive queries to GA, the decision problem for Graph Automorphism. As a consequence, we show that some problems related to GA are actually polynomial-time truth-table equivalent to GA. One of these results provides an answer to an open question of Lubiw [SIAM J. Comput. 10 (1981), 11 21]. ] 1996

DOI: 10.1006/inco.1996.0097

Cite this paper

@inproceedings{Agrawal1996ANO, title={A Note on Decision versus Search for Graph Automorphism}, author={Manindra Agrawal and Vikraman Arvind}, booktitle={Inf. Comput.}, year={1996} }