Quasipolynomial-time canonical form for steiner designs

DOI10.1145/2488608.2488642zbMath1293.05028OpenAlexW1963934374MaRDI QIDQ5495796

John Wilmes, László Babai

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2488608.2488642

zbMATH Keywords

algorithmsstrongly regular graphscanonical formsgraph isomorphismcombinatorial designs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of finite geometries (05B25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Unnamed Item ⋮ On the automorphism groups of strongly regular graphs. II.

This page was built for publication: Quasipolynomial-time canonical form for steiner designs