Faster canonical forms for strongly regular graphs (extended abstract)

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2013, Pages 157-166

  Babai, Lászĺo ^a   Chen, Xi ^b   Sun, Xiaorui ^b   Teng, Shang Hua ^c   Wilmes, John ^a  

^a UNIVERSITY OF CHICAGO   (United States)

^b Columbia University ^*  (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Algorithms; Graph isomorphism; Strongly regular graphs

Indexed keywords

AUTOMORPHISMS; CANONICAL FORM; DIVIDE AND CONQUER; EXTENDED ABSTRACTS; GRAPH ISOMORPHISM; GROUP THEORETIC METHOD; POLY-LOGARITHMIC FACTORS; STRONGLY REGULAR GRAPHS;

ALGORITHMS; COMPUTER SCIENCE; GRAPHIC METHODS; HEURISTIC METHODS; SET THEORY;

GRAPH THEORY;

EID: 84893321204     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2013.25     Document Type: Conference Paper

References (21)

1. O. Goldreich, S. Micali, and A. Wigderson, "Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof system, " J. ACM, vol. 38, no. 1, pp. 691-729, 1991.
2. L. Babai and S. Moran, "Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes, " J. Comp. Syst. Sci., vol. 36, pp. 254-276, 1988.
3. L. Babai and E. M. Luks, "Canonical labeling of graphs, " In: 15th STOC, pp. 171-183, 1983.
4. L. Babai, W. M. Kantor, and E. M. Luks, "Computational complexity and the classification of finite simple groups, " In: 24th FOCS, pp. 162-171, 1983.
5. V. N. Zemlyachenko, N. M. Korneenko, and R. I. Tyshkevich, "Graph isomorphism problem, " Zapiski Nauchn. Semin. LOMI, vol. 118, pp. 83-158, 215, 1982.
6. R. C. Read and D. G. Corneil, "The graph isomorphism disease, " J. Graph Th., vol. 1, no. 4, pp. 339-363, 1977.
7. L. Babai, "On the complexity of canonical labeling of strongly regular graphs, " SIAM J. Comput., vol. 9, no. 1, pp. 212-216, 1980.
8. L. Babai, "On the order of uniprimitive permutation groups, " Annals of Math., vol. 113, no. 3, pp. 553-568, 1981.
9. D. A. Spielman, "Faster isomorphism testing of strongly regular graphs, " In: 28th STOC, pp. 576-584, 1996.
10. J. J. Seidel, "Strongly regular graphs with (-1, 1, 0)- Adjacency matrix having eigenvalue 3, " Linear Algebra Appl., vol. 1, pp. 281-298, 1968.
11. A. Neumaier, "Strongly regular graphs with smallest eigenvalue -m, " Arch. Math., vol. 33, no. 4, pp. 392- 400, 1979.
12. A. Neumaier, "Quasiresidual 2-designs, 1 1 2 -designs, and strongly regular multigraphs, " Geom. Dedicata, vol. 12, no. 4, pp. 351-366, 1982.
13. L. Babai and J. Wilmes, "Asymptotic Delsarte cliques in strongly regular graphs, " in preparation.
14. G. L. Miller, "On the nlog n isomorphism technique: A preliminary report, " In: 10th STOC, pp. 51-58, 1978.
15. L. Babai and J. Wilmes, "Quasipolynomial-time canonical form for Steiner designs, " In: 45th STOC, pp. 261- 270, 2013.
16. X. Chen, X. Sun, and S.-H. Teng, "Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems, " In: 45th STOC, pp. 271-280, 2013.
17. X. Chen, X. Sun, and S.-H. Teng, "A new bound on the order of the automorphism group of strongly regular graphs, " in preparation.
18. G. L. Miller, "Isomorphism of graphs which are pairwise k-separable, " Information and Control, vol. 56, no. 1-2, pp. 21-33, 1983.
19. B. Weisfeiler, Ed., On construction and identification of graphs, ser. Lecture Notes in Mathematics. Springer- Verlag, 1976, vol. 558.
20. E. M. Luks, "Isomorphism of graphs of bounded valence can be tested in polynomial time, " J. Comp. Syst. Sci., vol. 25, no. 1, pp. 42-65, 1982.
21. L. Babai, "Alternating groups involved in the automorphism groups of strongly regular graphs, " 2013, in preparation.