Moderately exponential bound for graph isomorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 117 LNCS, Issue , 1981, Pages 34-50

  Babai, László ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034232065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10854-8_4     Document Type: Conference Paper

References (32)

1. L. Babai, Monte-Carlo algorithms in graph isomorphism testing, preprint 1979.
2. L. Babai, Isomorphism testing and symmetry of graphs, in: Ann. Discr. Math. 8, 1980, 101–109.
3. L. Babai, On the complexity of canonical labelling of strongly regular graphs, SIAM J. Comp. 9, 1980, 212–216.
4. L. Babai, On the order of uniprimitive permutation groups, Ann. Math. 109, 1981.
5. L. Babai, On the order of doubly transitive permutation groups, submitted
6. L. Babai, P. J. Cameron, P. P. Pálfy, On the order of primitive permutation groups with bounded nonabelian composition factors, in preparation.
7. L. Babai, P. Erdős, S. M. Selkow, Random graph isomorphism, SIAM J. Comp. 9, 1980, 628–635.
8. L. Babai, D. Yu. Grigoryev, Isomorphism testing for graphs with bounded eigenvalue multiplicities, in preparation.
9. L. Babai, L. Kučera, Canonical labelling of graphs in linear average time, Proc. 20th IEEE FOCS Symp., 1979, 39–46.
10. L. Babai, L. Lovász, Permutation groups and almost regular graphs, Studia Sci. Math. Hungar. 8, 1973, 141–150.
11. P. J. Cameron, Finite permutation groups and finite simple groups, Bull. Lond. Math. Soc. 13, 1981, 1–22.
12. N. Deo, J. M. Davis, R. E. Lord, A new algorithm for digraph isomorphism, BIT 17, 1977, 16–30.
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.
14. M. L. Furst, J. E. Hopcroft, E. M. Luks, Polynomial time algorithms for permutation groups, Proc. 21st IEEE FOCS Symp., 1980, 36–41.
15. M. K. Goldberg, A nonfactorial algorithm for testing isomorphism of two graphs, preprint 1981.
16. J. E. Hopcroft, R. E. Tarjan, Efficient planarity testing, J. ACM 21, 1974, 549–568.
17. J. E. Hopcroft, R. E. Tarjan, Isomorphism of planar graphs, in Complexity of Computations, Miller, Thatcher, eds./Plenum Press, N. Y. 1972, 143–150.
18. J. E. Hopcroft, J. Wong, Linear time algorithm for isomorphism of planar graphs, Proc. Sixth ACM Symp. Th. Comp., 1974, 172–184.
19. R. M. Karp, Probabilistic analysis of a canonical numbering algorithm for graphs, Proc. Symp. Pure Math. 34, AMS 1979, 365–378.
20. D. Lichtenstein, Isomorphism for graphs embeddable on the projective plane, Proc. 12th ACM Symp. Th. Comp., 1980, 218–224.
21. R. M. Lipton, The beacon set approach to graph isomorphism, SIAM J. Comp. 9, 1980.
22. E. M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Proc. 21st IEEE FOCS Symp., 1980, 42–49.
23. G. L. Miller, Isomorphism testing for graphs of bounded genus, Proc. 12th ACM Symp. Th. Comp., 1980, 225–235.
24. P. P. Pálfy, On the order of primitive solvable groups, J. Algebra, submitted.
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.
26. W. T. Tutte, A family of cubical graphs, Proc. Cambr. Phil. Soc. 43, 1947, 459–474
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.
28. H. Wielandt, Finite Permutation groups, Acad. Press, London 1964.
29. V. N. Zemlyachenko, Canonical numbering of trees, Russian/, Proc. Seminar on Comb. Anal. at Moscow State Univ., Moscow 1970.
30. V. N. Zemlyachenko, On algorithms of graph identification, Russian/, Questions of Cybernetics 15, Proc. 2nd All-Union Seminar on Combinat. Math., Moscow, 1975, 33–41.
31. V. N. Zemlyachenko, Determination of isomorphism of graphs, Russian/, in Mathem. Problems of Modelling Complex Objects, Karelian Branch of the Acad. Sci. USSR, Petrozavodsk 1979, 57–64.
32. V. N. Zemlyachenko, Polynomial algorithm of identification of almost all graphs, Russian/, Karelian Branch of the Acad. Sci. USSR, in print.