Graph isomorphism in quasipolynomial time parameterized by treewidth

11/25/2019
by   Daniel Wiebking, et al.
0

We extend Babai's quasipolynomial-time graph isomorphism test (STOC 2016) and develop a quasipolynomial-time algorithm for the multiple-coset isomorphism problem. The algorithm for the multiple-coset isomorphism problem allows to exploit graph decompositions of the given input graphs within Babai's group theoretic framework. We use it to develop a graph isomorphism test that runs in time n^polylog(k) where n is the number of vertices and k is the maximum treewidth of the given graphs and polylog(k) is some polynomial in log(k). Our result generalizes Babai's quasipolynomial-time graph isomorphism test.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/13/2018

A Faster Isomorphism Test for Graphs of Small Degree

Luks's algorithm (JCSS 1982) to test isomorphism of bounded degree graph...
04/28/2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs

Treewidth is arguably the most important structural graph parameter lead...
11/04/2021

Finding All Leftmost Separators of Size ≤ k

We define a notion called leftmost separator of size at most k. A leftmo...
10/04/2018

Parameterized Leaf Power Recognition via Embedding into Graph Products

The k-leaf power graph G of a tree T is a graph whose vertices are the l...
11/09/2018

Minimizing and Computing the Inverse Geodesic Length on Trees

The inverse geodesic length (IGL) of a graph G=(V,E) is the sum of inver...
06/28/2021

Isomorphism Testing Parameterized by Genus and Beyond

We present an isomorphism test for graphs of Euler genus g running in ti...
07/16/2021

On the Extended TSP Problem

We initiate the theoretical study of Ext-TSP, a problem that originates ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.