Skip to main content
SpringerLink
Log in

Moderately exponential bound for graph isomorphism

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 117))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Babai, Monte-Carlo algorithms in graph isomorphism testing, preprint 1979.

    Google Scholar 

  2. —, Isomorphism testing and symmetry of graphs, in: Ann. Discr. Math. 8 /1980/ 101–109.

    Google Scholar 

  3. —, On the complexity of canonical labelling of strongly regular graphs, SIAM J. Comp. 9 /1980/ 212–216.

    Google Scholar 

  4. —, On the order of uniprimitive permutation groups, Ann. Math. 109 /1981/.

    Google Scholar 

  5. —, On the order of doubly transitive permutation groups, submitted

    Google Scholar 

  6. —, P.J. Cameron, P.P. Pálfy, On the order of primitive permutation groups with bounded nonabelian composition factors, in preparation.

    Google Scholar 

  7. —, P. Erdős, S.M. Selkow, Random graph isomorphism, SIAM J. Comp. 9 /1980/ 628–635.

    Google Scholar 

  8. —, D.Yu. Grigoryev, Isomorphism testing for graphs with bounded eigenvalue multiplicities, in preparation.

    Google Scholar 

  9. —, L. Ku<cera, Canonical labelling of graphs in linear average time, Proc. 20th IEEE FOCS Symp. /1979/ 39–46.

    Google Scholar 

  10. —, L. Lovász, Permutation groups and almost regular graphs, Studia Sci. Math. Hungar. 8 /1973/ 141–150.

    Google Scholar 

  11. P.J. Cameron, Finite permutation groups and finite simple groups, Bull. Lond. Math. Soc. 13 /1981/ 1–22.

    Google Scholar 

  12. N. Deo, J.M. Davis, R.E. Lord, A new algorithm for digraph isomorphism, BIT 17 /1977/ 16–30.

    Google Scholar 

  13. I.S. Filotti, J.N. Mayer, A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus, Proc. 12th ACM Symp. Th. Comp. /1980/ 236–243.

    Google Scholar 

  14. M.L. Furst, J.E. Hopcroft, E.M. Luks, Polynomial time algorithms for permutation groups, Proc. 21st IEEE FOCS Symp. /1980/ 36–41.

    Google Scholar 

  15. M.K. Goldberg, A nonfactorial algorithm for testing isomorphism of two graphs, preprint 1981.

    Google Scholar 

  16. J.E. Hopcroft, R.E. Tarjan, Efficient planarity testing, J. ACM 21 /1974/ 549–568.

    Google Scholar 

  17. —,—, Isomorphism of planar graphs, in Complexity of Computations /Miller, Thatcher, eds./ Plenum Press, N.Y. 1972, 143–150.

    Google Scholar 

  18. —, J. Wong, Linear time algorithm for isomorphism of planar graphs, Proc. Sixth ACM Symp. Th. Comp. /1974/ 172–184.

    Google Scholar 

  19. R.M. Karp, Probabilistic analysis of a canonical numbering algorithm for graphs, Proc. Symp. Pure Math. 34, AMS 1979, 365–378.

    Google Scholar 

  20. D. Lichtenstein, Isomorphism for graphs embeddable on the projective plane, Proc. 12th ACM Symp. Th. Comp. /1980/ 218–224.

    Google Scholar 

  21. R.M. Lipton, The beacon set approach to graph isomorphism, SIAM J. Comp. 9 /1980/.

    Google Scholar 

  22. E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Proc. 21st IEEE FOCS Symp. /1980/ 42–49.

    Google Scholar 

  23. G.L. Miller, Isomorphism testing for graphs of bounded genus, Proc. 12th ACM Symp. Th. Comp. /1980/ 225–235.

    Google Scholar 

  24. P.P. Pálfy, On the order of primitive solvable groups, J. Algebra, submitted.

    Google Scholar 

  25. D.A. Suprunenko, R.F. Apatenok, Nilpotent irreducible groups of matrices over a finite field /Russian/, Doklady Akad. Nauk Belorus. SSR 5 /1961/ 535–537.

    Google Scholar 

  26. W.T. Tutte, A family of cubical graphs, Proc. Cambr. Phil. Soc. 43 /1947/ 459–474

    Google Scholar 

  27. A.J. Weir, Sylow p-subgroups of the classical groups over finite fields with characteristic prime to p, Proc. A.M.S. 6 /1955/ 529–533.

    Google Scholar 

  28. H. Wielandt, Finite Permutation groups, Acad. Press, London 1964.

    Google Scholar 

  29. V.N. Zemlyachenko, Canonical numbering of trees /Russian/, Proc. Seminar on Comb. Anal. at Moscow State Univ., Moscow 1970.

    Google Scholar 

  30. —, On algorithms of graph identification /Russian/, Questions of Cybernetics 15, Proc. 2nd All-Union Seminar on Combinat. Math., Moscow /1975/ 33–41.

    Google Scholar 

  31. —, Determination of isomorphism of graphs /Russian/, in Mathem. Problems of Modelling Complex Objects, Karelian Branch of the Acad. Sci. USSR, Petrozavodsk 1979, 57–64.

    Google Scholar 

  32. —, Polynomial algorithm of identification of almost all graphs /Russian/, Karelian Branch of the Acad. Sci. USSR, in print.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Algebra, Eötvös University, H-1088, Budapest, Hungary

    László Babai

Authors
  1. László Babai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Babai, L. (1981). Moderately exponential bound for graph isomorphism. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation