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 $n^{\text{polylog}(k)}$, where $k$ is a graph parameter such as the maximum degree. A second focus will be the combinatorial Weisfeiler-Leman algorithm.

翻译：我们概要介绍该图的异形问题的最新进展。 我们的主要焦点将放在巴比的准极形时间的变形测试以及随后导致设计异形算法的发展,其运行时间由 $n ⁇ text{polylog}(k)}美元(k)}计算,其中, $k$(k)是像最高程度这样的图形参数。 第二个焦点将是组合 Weisfeiler-Leman 算法。