Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 271-280

  Chen, Xi ^a   Sun, Xiaorui ^a   Teng, Shang Hua ^b  

^a Columbia University ^*  (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Canonical forms; Graph isomorphism; Steiner 2 systems; Strongly regular graphs

Indexed keywords

CANONICAL FORM; COMBINATORIAL STRUCTURES; GRAPH ISOMORPHISM; ISOMORPHISM TESTING; REFINEMENT METHODS; STEINER; STRONGLY REGULAR GRAPHS; STRUCTURAL TOOLS;

COMPUTATION THEORY; SET THEORY;

GRAPH THEORY;

EID: 84879807122     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488643     Document Type: Conference Paper

References (25)

1. L. Babai. Monte-Carlo algorithms in graph isomorphism testing. Université de Montréal Technical Report, pages 79-10, 1979.
2. L. Babai. On the complexity of canonical labeling of strongly regular graphs. SIAM Journal on Computing, 9(1):212-216, 1980.
3. L. Babai. Moderately exponential bound for graph isomorphism. In Proceedings of the International Conference on Fundamentals of Computation Theory, pages 34-50, 1981.
4. L. Babai. On the order of uniprimitive permutation groups. Annals of Mathematics, 113(3):553-568, 1981.
5. L. Babai, P. Erdos, and S.M. Selkow. Random graph isomorphism. SIAM Journal on Computing, 9(3):628-635, 1980.
6. L. Babai, D.Y. Grigoryev, and D.M. Mount. Isomorphism of graphs with bounded eigenvalue multiplicity. In STOC, pages 310-324, 1982.
7. L. Babai and L. Kücera. Canonical labelling of graphs in linear average time. In FOCS, pages 39-46, 1979.
8. L. Babai and E.M. Luks. Canonical labeling of graphs. In STOC, pages 171-183, 1983.
9. L. Babai and R. Mathon. The d-dimensional Weisfeiler-Lehman algorithm. L. Babai's lecture notes on Graph Isomorphism, Univ. Toronto, 1979.
10. L. Babai and J. Wilmes. Quasipolynomial-time canonical form for Steiner designs. In STOC, 2013.
11. R.C. Bose. Strongly regular graphs, partial geometries and partially balanced designs. Pacific Journal of Mathematics, 13(2):389-419, 1963.
12. J. Cai, M. Fürer, and N. Immerman. An optimal lower bound on the number of variables for graph identifications. Combinatorica, 12(4):389-410, 1992.
13. T. Czajka and G. Pandurangan. Improved random graph isomorphism. Journal of Discrete Algorithms, 6(1):85-92, 2008.
14. I.S. Filotti and J.N. Mayer. A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In STOC, pages 236-243, 1980.
15. J.E. Hopcroft and J.K. Wong. Linear time algorithm for isomorphism of planar graphs. In STOC, pages 172-184, 1974.
16. F.T. Leighton and G.L. Miller. Certificates for graphs with distinct eigenvalues. Manuscript, 1979.
17. D. Lichtenstein. Isomorphism for graphs embeddable on the projective plane. In STOC, pages 218-224, 1980.
18. E.M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences, 25(1):42-65, 1982.
19. G.L. Miller. On the nlog n isomorphism technique. In STOC, pages 51-58, 1978.
20. G.L. Miller. Isomorphism testing for graphs of bounded genus. In STOC, pages 225-235, 1980.
21. G.L. Miller and J.H. Reif. Parallel tree contraction, Part 2: Further applications. SIAM Journal on Computing, 20(6):1128-1147, 1991.
22. A. Neumaier. Strongly regular graphs with smallest eigenvalue - m. Archiv der Mathematik, 33:392-400, 1979.
23. R.C. Read and D.G. Corneil. The graph isomorphism disease. Journal of Graph Theory, 1(4):339-363, 1977.
24. D.A. Spielman. Faster isomorphism testing of strongly regular graphs. In STOC, pages 576-584, 1996.
25. V.N. Zemlyachenko, N.M. Korneenko, and R.I. Tyshkevich. Graph isomorphism problem. Journal of Mathematical Sciences, 29:1426-1481, 1985.