GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM

DOI10.1142/9789813272880_0183zbMath1490.68116OpenAlexW2972627426MaRDI QIDQ5122158

László Babai

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dbf7af33cefdf56b5ec2f0b0a212e3f5aa88ad49

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) General theory for finite permutation groups (20B05)

Related Items (10)

Computing Autotopism Groups of Partial Latin Rectangles ⋮ On the WL-dimension of circulant graphs of prime power order ⋮ On multidimensional Schur rings of finite groups ⋮ Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating ⋮ The Weisfeiler-Leman dimension of distance-hereditary graphs ⋮ Linear Representation of Graphs: Applications to Molecular Graphs ⋮ A characterization of Johnson and Hamming graphs and proof of Babai's conjecture ⋮ Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs ⋮ Image matching from handcrafted to deep features: a survey ⋮ Two-closures of supersolvable permutation groups in polynomial time

This page was built for publication: GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM