ISOMORPHISM TESTING FOR GRAPHS EXCLUDING SMALL MINORS

被引:1
作者
Grohe, M. A. R. T. I. N. [1 ]
Neuen, D. A. N. I. E. L. [2 ]
Wiebking, D. A. N. I. E. L. [1 ]
机构
[1] Rhein Westfal TH Aachen, Aachen, Germany
[2] Simon Fraser Univ, Burnaby, BC V5A 1S6, Canada
关键词
graph isomorphism problem; excluded minors; structure of automorphism group; BOUNDED VALENCE; NUMBER;
D O I
10.1137/21M1401930
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We prove that there is a graph isomorphism test running in time npolylog(h) on n-vertex graphs excluding some h-vertex graph as a minor. Previously known bounds were npoly(h) [I. N. Ponomarenko, J. Soviet Math., 55 (1991), pp. 1621--1643] and npolylog(n) [L. Babai, Proceedings of the 48th Annual ACM Symposium on Theory of Computing, 2016, pp. 684--697]. For the algorithm we combine recent advances in the group-theoretic graph isomorphism machinery with new graph -theoretic arguments.
引用
收藏
页码:238 / 272
页数:35
相关论文
共 38 条