An Improved Isomorphism Test for Bounded-tree-width Graphs
An Improved Isomorphism Test for Bounded-tree-width Graphs
复制标题
有界树宽度图的改进同构测试
DOI:
10.1145/3382082
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
D. Wiebking
中科院分区:
文献类型:
--
作者:
M. Grohe;D. Neuen;P. Schweitzer;D. Wiebking
We give a new FPT algorithm testing isomorphism ofn-vertex graphs of tree-widthkin time2kpolylog(k)n3, improving the FPT algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS 2014), which runs in time 2O(k5 log k)n5. Based on an improved version of the isomorphism-invariant graph decomposition technique introduced by Lokshtanov et al., we prove restrictions on the structure of the automorphism groups of graphs of tree-widthk. Our algorithm then makes heavy use of the group theoretic techniques introduced by Luks (JCSS 1982) in his isomorphism test for bounded degree graphs and Babai (STOC 2016) in his quasipolynomial isomorphism test. In fact, we even use Babai’s algorithm as a black box in one place.We also give a second algorithm that, at the price of a slightly worse running time 2O(k2 log k)n3, avoids the use of Babai’s algorithm and, more importantly, has the additional benefit that it can also be used as a canonization algorithm.
登录
查看更多内容
DOI:
10.1007/3-540-12689-9_114
发表时间:
1983
期刊:
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
影响因子:
--
作者:
G. Miller
通讯作者:
G. Miller
DOI:
10.1007/bf01098279
发表时间:
1991
期刊:
Journal of Soviet Mathematics
影响因子:
--
作者:
I. Ponomarenko
通讯作者:
I. Ponomarenko
DOI:
--
发表时间:
2019
期刊:
International Colloquium on Automata, Languages and Programming
影响因子:
--
作者:
Daniel Wiebking
通讯作者:
Daniel Wiebking
影响因子:
1
作者:
H. Bodlaender
通讯作者:
H. Bodlaender
DOI:
10.4230/lipics.esa.2016.70
发表时间:
2016
期刊:
ArXiv
影响因子:
--
作者:
Daniel Neuen
通讯作者:
Daniel Neuen