@online{Grohe_arXiv2004.07671,
TITLE = {Isomorphism Testing for Graphs Excluding Small Minors},
AUTHOR = {Grohe, Martin and Neuen, Daniel and Wiebking, Daniel},
LANGUAGE = {eng},
URL = {https://arxiv.org/abs/2004.07671},
EPRINT = {2004.07671},
EPRINTTYPE = {arXiv},
YEAR = {2020},
ABSTRACT = {We prove that there is a graph isomorphism test running in time<br>$n^{\operatorname{polylog}(h)}$ on $n$-vertex graphs excluding some $h$-vertex<br>graph as a minor. Previously known bounds were $n^{\operatorname{poly}(h)}$<br>(Ponomarenko, 1988) and $n^{\operatorname{polylog}(n)}$ (Babai, STOC 2016). For<br>the algorithm we combine recent advances in the group-theoretic graph<br>isomorphism machinery with new graph-theoretic arguments.<br>},
}