Skip to main content
SpringerLink
Log in

Permutation Groups and the Graph Isomorphism Problem

  • Chapter
  • First Online:
Perspectives in Computational Complexity

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 26))

  • 789 Accesses

Abstract

In this article we discuss various algorithms for permutation group-theoretic problems and their connections to Graph Isomorphism. In the last part we examine the group representability problem on graphs, its connection to Graph Isomorphism, and discuss some open problems that arise in this context.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. V. Arvind, P.P. Kurur, Graph Isomorphism is in SPP in 43rd Annual IEEE Symposium of Foundations of Computer Science, November 2002, pp. 743–750.

    Google Scholar 

  2. V. Arvind, P.P. Kurur, T.C. Vijayaraghavan, Bounded color multiplicity graph isomorphism is in the #L hierarchy in 20th IEEE Conference on Computational Complexity (CCC 2005), June 2005, pp. 13–27.

    Google Scholar 

  3. L. Babai, E.M. Luks, Canonical labeling of graphs. in Proceedings of the Fifteenth Annual ACM Symposium on Theory of, Computing, 1983, pp. 171–183.

    Google Scholar 

  4. L. Babai, P.J. Cameron, P.P. Pálfy, On the order of primitive groups with restricted nonabelian composition factors. J. Algebra. 79, 161–168 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Boppana, J. Hastad, S. Zachos, Does co-NP have short interactive proofs. Inf. Process. Lett. 25(2), 127–132 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. J.D. Dixon B. Mortimer, Permutation Groups. Graduate Texts in Mathematics, vol 163, (Springer, New York, 1991).

    Google Scholar 

  7. S. Dutta, P.P. Kurur, Representating groups on graphs. CoRR, abs/0904.3941 (2009).

    Google Scholar 

  8. S. Dutta, N. Limaye, P. Nimbhorkar, T. Thierauf, F. Wagner, Planar graph isomorphism is in logspace. in Proceedings of the IEEE Conference on Computational Complexity, 2009, pp 124–203.

    Google Scholar 

  9. W. Feit, J.G. Thompson, Solvability of groups of odd order. Pac. J. Math. 13(3), 775–1027, (1963). URL http://projecteuclid.org/euclid.pjm/1103053943

  10. S.A. Fenner, L. Fortnow, S.A. Kurtz, Gap-definable counting classes. in Structure in Complexity Theory Conference, 1991, pp 30–42. URL http://citeseer.nj.nec.com/fenner92gapdefinable.html

  11. M.L. Furst, J.E. Hopcroft, E.M. Luks, Polynomial-time algorithms for permutation groups. in IEEE Symposium on Foundations of Computer, Science, 1980, pp. 36–41.

    Google Scholar 

  12. M. Garey, D. Johnson, Computers and intractability: a guide to the theory of NP-completeness (W. H. Freeman, New York, 1979)

    MATH  Google Scholar 

  13. M. Hall Jr., The Theory of Groups, 1st edn. (The Macmillan Company, New York, 1959)

    Google Scholar 

  14. J.E. Hopcroft, J.K. Wong, Linear time algorithm for isomorphism of planar graphs (preliminary report). in Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC ’74 (ACM, New York, 1974), pp. 172–184.

    Google Scholar 

  15. J. Köbler, U. Schöning, J. Torán, Graph isomorphism is low for pp. Comput. Complex. 2(4), 301–330 (1992) URL http://citeseer.nj.nec.com/obler92graph.html

  16. J. Köbler, U. Schöning, J. Torán, The Graph Isomorphism Problem: Its Structural Complexity (Birkhauser, Switzerland, 1993)

    Book  MATH  Google Scholar 

  17. P.P. Kurur, Complexity upper bounds using permutation group theory. PhD thesis, Institute of Mathematical Sciences, Chennai, India, 2006.

    Google Scholar 

  18. R.E. Ladner, On the structure of polynomial time reducibility. J. ACM 22(1), 155–171 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  19. E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42–65 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  20. E.M. Luks, Parallel algorithms for permutation groups and graph isomorphism, in Proceedings of the IEEE Foundations of Computer Science, IEEE Computer Society (1986), pp. 292–302

    Google Scholar 

  21. E.M. Luks, Permutation groups and polynomial time computations. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 11, 139–175 (1993)

    MathSciNet  Google Scholar 

  22. R. Mathon, A note on graph isomorphism counting problem. Inf. Process. Lett. 8(3), 131–132 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  23. P.P. Pálfy, A polynomial bound for the orders of primitive solvable groups. J. Algebra 77, 127–137 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  24. U. Schöning, Graph isomorphism is in the low hierarchy. in Symposium on Theoretical Aspects of Computer, Science (1987), pp. 114–124

    Google Scholar 

  25. C.C. Sims, Graphs and finite permutation groups. Mathematische Zeitschrift 95, 76–86 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  26. C.C. Sims, Some group theoretic algorithms. Top. Algebra 697, 108–124 (1978)

    Google Scholar 

  27. J. Torán, On the hardness of graph isomorphism. SIAM J. Comput. 33(5), 1093–1108 (2004)

    Google Scholar 

  28. H. Wielandt, Finite Permutation Groups (Academic Press, New York, 1964)

    MATH  Google Scholar 

  29. V.N. Zemlyachenko, N.M. Korneenko, R.I. Tyshkevich, Graph isomorphism problem. J. Sov. Math. 29, 1426–1481 (1985)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, 208016, Uttar Pradesh, India

    Sumanta Ghosh & Piyush P Kurur

Authors
  1. Sumanta Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piyush P Kurur
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sumanta Ghosh .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, Kanpur, India

    Manindra Agrawal

  2. CIT Campus, Institute of Mathematical Sciences, Chennai, India

    Vikraman Arvind

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ghosh, S., Kurur, P.P. (2014). Permutation Groups and the Graph Isomorphism Problem. In: Agrawal, M., Arvind, V. (eds) Perspectives in Computational Complexity. Progress in Computer Science and Applied Logic, vol 26. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-05446-9_11

Download citation

Publish with us

Policies and ethics

Search

Navigation