An Improved Isomorphism Test for Bounded-tree-width Graphs

ACM Transactions on Algorithms, vol. 16, pp. 1–31

Abstract

We give a new FPT algorithm testing isomorphism of n -vertex graphs of tree-width k in time 2 kpolylog(k) n 3 , improving the FPT algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS 2014), which runs in time 2 O(k5 log k) n 5 . 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-width k . 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 2 O(k2 log k) n 3 , avoids the use of Babai’s algorithm and, more importantly, has the additional benefit that it can also be used as a canonization algorithm.

Authors 4

1. Martin Grohe Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Germany

   RWTH Aachen University (Germany)

2. Daniel Neuen Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Germany

   RWTH Aachen University (Germany)

3. Pascal Schweitzer

   University of Kaiserslautern

   Affiliation as printed

   Technische Universität Kaiserslautern, Germany

4. Daniel Wiebking Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Germany

   RWTH Aachen University (Germany)