The Weisfeiler-Leman algorithm and the diameter of Schreier graphs
From MaRDI portal
Publication:2286350
DOI10.4171/GGD/521zbMath1433.05094arXiv1707.01267OpenAlexW3100013554MaRDI QIDQ2286350
Publication date: 22 January 2020
Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.01267
Geometric group theory (20F65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Approximate subgroups of linear groups.
- On the diameter of Cayley graphs of the symmetric group
- On the diameter of permutation groups.
- Faster Canonical Forms for Primitive Coherent Configurations
- Growth in finite simple groups of Lie type
- A diameter bound for finite simple groups of large rank
- Graph isomorphism in quasipolynomial time [extended abstract]
This page was built for publication: The Weisfeiler-Leman algorithm and the diameter of Schreier graphs