# Recent Advances on the Graph Isomorphism Problem

arXiv: https://arxiv.org/abs/2011.01366 · HTML: https://mlsanity.com/paper/2011.01366/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Nov 2020.

## Built on by (most cited first, 4 of 4)

- [Weisfeiler and Leman go Machine Learning: The Story so far](https://mlsanity.com/paper/2112.09992/) (2021)
- [Reconstruction for Powerful Graph Representations](https://mlsanity.com/paper/2110.00577/) (2021)
- [Defining Cases and Variants for Object-Centric Event Data](https://mlsanity.com/paper/2208.03235/) (2022)
- [GPU-accelerated simulated annealing based on p-bits with real-world device-variability modeling](https://mlsanity.com/paper/2601.14476/) (2026)

## Abstract (arXiv)

We give an overview of recent advances on the graph isomorphism problem. Our main focus will be on Babai's quasi-polynomial time isomorphism test and subsequent developments that led to the design of isomorphism algorithms with a quasi-polynomial parameterized running time of the from npolylog(k), where k is a graph parameter such as the maximum degree. A second focus will be the combinatorial Weisfeiler-Leman algorithm.