research-article

A Note on Decision versus Search for Graph Automorphism

Authors:

M. Agrawal,

V. ArvindAuthors Info & Claims

Information and Computation, Volume 131, Issue 2

Pages 179 - 189

https://doi.org/10.1006/inco.1996.0097

Published: 15 December 1996 Publication History

Abstract

We show that for any graphG,knontrivial automorphisms ofG if as many exist can be computed in time |G|O(logk)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].

References

[1]

Balcázar, J. L. (1989), Self-reducibility structures and solutions to NP problems, Rev. Mat. Univ. Complut. Madrid 2 (23), 175-184.

Google Scholar

[2]

Balcázar, J. L., Díaz, J., and Gabarró, J. (1988), "Structural Complexity I," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin/New York.

Crossref

Google Scholar

[3]

Blum, M., and Kannan, S. (1995), Designing programs that check their work, J. Assoc. Comput. Mach. 43 (1), 269-291.

Digital Library

Google Scholar

[4]

Fortnow, L., Kannan, S., and Mahaney, S. (1993), Graph automorphism is nonadaptively checkable, manuscript.

Google Scholar

[5]

Lozano, A., and Torán, J. (1992), On the nonuniform complexity of the graph isomorphism problem, in "Proceedings of the Structure in Complexity Theory Conference," pp. 118-129.

Google Scholar

[6]

Harary, F. (1969), "Graph Theory," Addison-Wesley, Reading, MA.

Google Scholar

[7]

Hoffmann, C. M. (1982), "Group-Theoretic Algorithms and Graph Isomorphism," Lecture Notes in Computer Science, Vol. 136, Springer-Verlag, Berlin/New York.

Google Scholar

[8]

Köbler, J., Schöning, U., and Torán, J. (1992). "Graph Isomorphism: Its Structural Complexity," Birkhäuser, Boston.

Crossref

Google Scholar

[9]

Lubiw, A. (1981), Some NP-complete problems similar to Graph Isomorphism, SIAM J. Comput. 10 , 11-21.

Digital Library

Google Scholar

[10]

Mathon, R. (1979), A note on the graph isomorphism counting problem, Inform. Process. Lett. 8 , 131-132.

Crossref

Google Scholar

[11]

Schnorr, C. P. (1982), On self-transformable combinatorial problems, Math. Programming Study 14 , 95-103.

Google Scholar

[12]

Schöning, U. (1988), Graph isomorphism is in the low hierarchy, J. Comput. System Sci. 37 , 312-323.

Digital Library

Google Scholar

Cited By

View all

Ogihara MTantau T(2019)On the reducibility of sets inside NP to sets with low information contentJournal of Computer and System Sciences10.5555/1046081.104608269:4(499-524)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.5555/1046081.1046082
Nagoya TToda S(2009)Computational complexity of computing a partial solution for the Graph Automorphism problemsTheoretical Computer Science10.1016/j.tcs.2009.01.001410:21-23(2064-2071)Online publication date: 1-May-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.01.001

Index Terms

A Note on Decision versus Search for Graph Automorphism
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

THE COMPLEXITY OF DECISION VERSUS SEARCH
Note: The supereulerian graphs in the graph family C(l,k)

For integers l and k with l>0 and k>=0, let C(l,k) denote the family of 2-edge-connected graphs G such that for every bond S with two or three edges, each component of G-S has at least (|V(G)|-k)/l vertices. In this note we get: (1) If G@?C(6,5) and |V(...
The Complexity of Decision Versus Search

A basic question about NP is whether or not search reduces in polynomial time to decision. This paper indicates that the answer is negative: Under a complexity assumption (that deterministic and nondeterministic double-exponential time are unequal) a ...

Comments

Information & Contributors

Information

Published In

Information and Computation Volume 131, Issue 2

Dec. 15, 1996

94 pages

ISSN:0890-5401

Editor:
Albert R. Meyer
Massachusetts Institute of Technology, Cambridge

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 15 December 1996

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ogihara MTantau T(2019)On the reducibility of sets inside NP to sets with low information contentJournal of Computer and System Sciences10.5555/1046081.104608269:4(499-524)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.5555/1046081.1046082
Nagoya TToda S(2009)Computational complexity of computing a partial solution for the Graph Automorphism problemsTheoretical Computer Science10.1016/j.tcs.2009.01.001410:21-23(2064-2071)Online publication date: 1-May-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.01.001

Abstract

References

Cited By

Index Terms

Recommendations

THE COMPLEXITY OF DECISION VERSUS SEARCH

Note: The supereulerian graphs in the graph family C(l,k)

The Complexity of Decision Versus Search

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations