Faster canonical forms for primitive coherent configurations

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 14-17-June-2015, Issue , 2015, Pages 693-702

  Sun, Xiaorui ^a   Wilmes, John ^b  

^a Department of Earth and Environmental Sciences   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; SET THEORY;

COHERENT CONFIGURATIONS; COMBINATORIAL APPROACH; COMBINATORIAL STRUCTURES; DIVIDE AND CONQUER METHODS; DIVIDE-AND-CONQUER APPROACH; POLY-LOGARITHMIC FACTORS; STRONGLY REGULAR GRAPHS; TECHNICAL DIFFICULTIES;

GROUP THEORY;

EID: 84958773064     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2746539.2746617     Document Type: Conference Paper

References (24)

1. L. Babai. Monte Carlo algorithms in graph isomorphism testing. Tech. Report 79-10, Dép. Math. et Stat., Univ. de Montréal, 1979. Available at: http: //people.cs.uchicago.edu/~laci/lasvegas79.pdf.
2. L. Babai. On the complexity of canonical labeling of strongly regular graphs. SIAM J. Comput., 9(1):212-216, 1980.
3. L. Babai. On the order of uniprimitive permutation groups. Ann. of Math., 113(3):553-568, 1981.
4. L. Babai. On the automorphism groups of strongly regular graphs I. In Proc. 5th ITCS, pages 359-368, 2014.
5. L. Babai, X. Chen, X. Sun, S.-H. Teng, and J. Wilmes. Faster canonical forms for strongly regular graphs. In Proc. 54th FOCS, pages 157-166, 2013.
6. L. Babai and P. Codenotti. Isomorphism of hypergraphs of low rank in moderately exponential time. In Proc. 49th FOCS, pages 667-676, 2008.
7. L. Babai, W. M. Kantor, and E. M. Luks. Computational complexity and the classification of finite simple groups. In Proc. 24th FOCS, pages 162-171, 1983.
8. L. Babai and E. M. Luks. Canonical labeling of graphs. In Proc. 15th STOC, pages 171-183, 1983.
9. L. Babai and J. Wilmes. Asymptotic Delsarte cliques in distance-regular graphs. 2013. To appear: J. Algebr. Comb.
10. L. Babai and J. Wilmes. Quasipolynomial-time canonical form for Steiner designs. In Proc. 45th STOC, pages 261-270, 2013.
11. J.-Y. Cai, M. Furer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12(4):389-410, 1992.
12. P. J. Cameron. Finite permutation groups and finite simple groups. Bull. London Math Soc., 13:1-22, 1981.
13. X. Chen, X. Sun, and S.-H. Teng. Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems. In Proc. 45th STOC, pages 271-280, 2013.
14. R. Frucht. Herstellung von Graphen mit vorgegebener abstrakter Gruppe. Composition Math., 6:239-250, 1938.
15. 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, 38(1):691-729, 1991.
16. D. G. Higman. Coherent configurations I. Geometriae Dedicata, 4:1-32, 1975.
17. E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci., 25(1):42-65, 1982.
18. K. Metsch. On a characterization of bilinear forms graphs. European Journal of Combinatorics, 20:293-306, 1999.
19. G. L. Miller. Graph isomorphism, general remarks. In Proc. 9th STOC, pages 143-150, 1977.
20. A. Neumaier. Strongly regular graphs with smallest eigenvalue -m. Arch. Math., 33(4):392-400, 1979.
21. D. A. Spielman. Faster isomorphism testing of strongly regular graphs. In Proc. 28th STOC, pages 576-584, 1996.
22. B. Weisfeiler, editor. On Construction and Identification of Graphs, volume 558 of Lecture Notes in Mathematics. Springer-Verlag, 1976.
23. B. Weisfeiler and A. A. Leman. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Tech. Info., 9:12-16, 1968.
24. V. N. Zemlyachenko, N. M. Korneenko, and R. I. Tyshkevich. Graph isomorphism problem. Zap. Nauchn. Sem. (LOMI), 118:83-158, 215, 1982.