Faster isomorphism testing of strongly regular graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 576-584

  Spielman, Daniel A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; SET THEORY; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; NUMERICAL ANALYSIS; PROBLEM SOLVING; THEOREM PROVING;

ISOMORPHISM TESTING; LATIN SQUARE; LOW DEGREE; REFINEMENT ALGORITHMS; SECOND LARGEST EIGENVALUE; STEINER; STRONGLY REGULAR GRAPHS;

GRAPHIC METHODS; GRAPH THEORY;

ISOMORPHISM; LATIN SQUARE GRAPH; NEUMAIER CLAW BOUND; STEINER GRAPH; STRONGLY REGULAR GRAPH;

EID: 0029702181     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.238006     Document Type: Conference Paper

References (26)

1. Laszlo Babai. Monte Carlo algorithms in graph isomorphism testing. Technical Report 79-10, Dep. Math et Stat., Univ. de Montreal, 1979.
2. Laszlo Babai. On the complexity of canonical labeling of strongly regular graphs. SIAM J. Comput., 9(1):212-216, 1980.
3. Laszlo Babai. Moderately exponential bound for graph isomorphism. In Fundamentals of Computation Theory, number 117 in Lecture Notes in Math, pages 34-50. Springer-Verlag, Berlin-Heidelberg-New York, 1981.
4. Laszlo Babai. On the order of uniprimitive permuation groups. Annals of Mathematics, 113:553-568, 1981.
5. Laszlo Babai, D. Yu. Grigoryev, and David M. Mount. Isomorphism of graphs with bounded eigenvalue multiplicity. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pages 310-324, 1982.
6. Laszlo Babai and Ludik Kucera. Canonical labelling of graphs in linear average time. In Proceedings of the 1920th IEEE Symposium on Foundations of Computer Science, pages 39-46, 1979.
7. Laszlo Babai and Eugene M. Luks. Canonical labeling of graphs. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 171-183, 1983.
8. R. C. Bose. Strongly regular graphs, partial geometries and partially balanced designs. Pacific J. Math., 13:389-419, 1963.
9. P. J. Cameron. Strongly regular graphs. In Selected Topics in Graph Theory, pages 337-380. Academic Press, London, 1978.
10. Jin-Yi Cai, Martin Fürer, and Neil Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12(4):389-410, 1992.
11. F. R. K. Chung, R. L. Graham, and R. M. Wilson. Quasi-random graphs. Combinatorica, 9(4):345-362, 1989.
12. I. S. Filotti and Jack N. Mayer. A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus (working paper). In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pages 236-243, 1980.
13. Ludek Kucera. Canonical labeling of regular graphs in linear average time. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 271-279, 1987.
14. David Lichtenstein. Isomorphism for graphs embeddable on the projective plane. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pages 218-224, 1980.
15. Eugene M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences, 25:42-65, 1982.
16. log n isomorphism technique: A preliminary report. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pages 51-58, 1978.
17. Gary Miller. Isomorphism testing for graphs of bounded genus. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pages 225-235, 1980.
18. Gary L. Miller. Isomorphism of k-contractible graphs, a generalization of bounded valence and bounded genus. Information and Control, 56:1-20, 1983.
19. B. Mohar. Isoperimetric numbers of graphs. Journal of Combinatorial Theory, Series B, 47:274-291, 1989.
20. A. Neumaier. Stronly regular graphs with smallest eigenvalue - m. Arch. Math., 33:392-400, 1979.
21. Ilja N. Ponomarenko. The isomorphism problem for classes of graphs. Soviet Math. Dokl., 39:119-122, 1989.
22. R. C. Read and D. G. Corneil. The graph isomorphism disease. J. Graph Theory, 1:339-363, 1977.
23. J. J. Seidel. Strongly regular graphs. In B. Bollobas, editor, Surveys in Combinatorics, volume 38 of London Mathematical Society Lecture Note Series, pages 157-180. Cambridge University Press, 1979.
24. Alistair Sinclair and Mark Jerrum. Approximative counting, uniform generation and rapidly mixing Markov chains. Information and Computation, 82(1):93-133, July 1989.
25. J. H. van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, 1992.
26. V. M. Zemlyachenko, N. M. Kornienko, and R. I. Tyshkevich. Graph isomorphism problem. Journal of Soviet Mathematics, 29:1426-1481, 1985.