Quasipolynomial-time canonical form for steiner designs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 261-270

  Babai, László ^a   Wilmes, John ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Algorithms; Canonical forms; Combinatorial designs; Graph isomorphism; Strongly regular graphs

Indexed keywords

CANONICAL FORM; COMBINATORIAL ALGORITHM; COMBINATORIAL DESIGN; COMBINATORIAL STRUCTURES; DIVIDE-AND-CONQUER ALGORITHM; GRAPH ISOMORPHISM; GRAPH ISOMORPHISM PROBLEM; STRONGLY REGULAR GRAPHS;

ALGORITHMS; COMPUTATION THEORY; DESIGN; GRAPHIC METHODS; METHOD OF MOMENTS; SET THEORY;

GRAPH THEORY;

EID: 84879813038     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488642     Document Type: Conference Paper

References (18)

1. L. Babai. On the complexity of canonical labeling of strongly regular graphs. SIAM J. Comput., 9(1):212-216, 1980.
2. L. Babai. On the order of uniprimitive permutation groups. Annals of Math., 113(3):553-568, 1981.
3. L. Babai, W. M. Kantor, and E. M. Luks. Computational complexity and the classification of finite simple groups. In: 24th FOCS, pages 162-171, 1983.
4. L. Babai and E. M. Luks. Canonical labeling of graphs. In: 15th STOC, pages 171-183, 1983.
5. R. C. Bose. Combinatorial problems of experimental design. I. Incomplete block designs. Proc. Sympos. Pure Math., 34:47-68, 1978.
6. J.-Y. Cai, M. Fürer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12(4):389-410, 1992.
7. X. Chen, X. Sun, and S.-H. Teng. Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems. In: 45th STOC, 2013.
8. C. J. Colbourn and P. C. van Oorschot. Applications of combinatorial designs in computer science. ACM Comput. Surv., 21(2):223-250, 1989.
9. M. Huber. Computational complexity of reconstruction and isomorphism testing for designs and line graphs. J. Comb. Theory A, 118(2):341-349, 2011.
10. E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci., 25(1):42-65, 1982.
11. G. L. Miller. On the nlog n isomorphism technique: A preliminary report. In: 10th STOC, pages 51-58, 1978.
12. A. Neumaier. Strongly regular graphs with smallest eigenvalue -m. Arch. Math., 33(4):392-400, 1979.
13. D. K. Ray-Chaudhuri and R. M. Wilson. On t-designs. Osaka J. Math., 12(3):737-744, 1975.
14. R. C. Read and D. G. Corneil. The graph isomorphism disease. J. Graph Theory, 1(4):339-363, 1977.
15. D. A. Spielman. Faster isomorphism testing of strongly regular graphs. In: 28th STOC, pages 576-584, 1996.
16. J. H. van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge U. Press, 2nd ed., 2001.
17. B. Weisfeiler, editor. On construction and identification of graphs, volume 558 of Lecture Notes in Mathematics. Springer-Verlag, 1976.
18. V. N. Zemlyachenko, N. M. Korneenko, and R. I. Tyshkevich. Graph isomorphism problem. Zapiski Nauchnykh Seminarov LOMI, 118:83-158, 215, 1982.