Towards faster isomorphism tests for bounded-degree graphs

02/13/2018
by   Martin Grohe, et al.
0

Luks' algorithm (JCSS 1982) to test isomorphism of bounded degree graphs in polynomial time is one of most important results in the context of the Graph Isomorphism Problem and has been repeatedly used as a basic building block for many other algorithms. In the light of Babai's (STOC 2016) quasipolynomial time algorithm for general isomorphism testing we investigate the question whether the techniques developed for this new algorithm can adapted to the bounded degree setting. More precisely, we ask the question whether there is an n^polylog(d)-isomorphism test for graphs of maximum degree d. While we cannot answer this questions yet, we prove that there is an n^polylog(d)-isomorphism test for all classes of graphs of maximum degree d and diameter at most O( n). In particular, this implies that there is an n^polylog(d)-isomorphism test for all families of d-regular expander graphs. We derive this result from a more general (and quite technical) theorem about the so-called string isomorphism problem for a family of groups that also arises in Luks' work. This theorem has also other interesting applications, for example to the isomorphism problem for relational structures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2018

A Faster Isomorphism Test for Graphs of Small Degree

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

Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs

The complexity of graph homomorphisms has been a subject of intense stud...
research
11/07/2018

Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty

One of the most fundamental questions in graph property testing is to ch...
research
06/19/2018

Defective and Clustered Colouring of Sparse Graphs

An (improper) graph colouring has "defect" d if each monochromatic subgr...
research
06/19/2018

Defective and Clustered Choosability of Sparse Graphs

An (improper) graph colouring has "defect" d if each monochromatic subgr...
research
11/21/2022

Algorithmic Applications of Hypergraph and Partition Containers

We present a general method to convert algorithms into faster algorithms...
research
12/04/2017

Distributed Computing Made Secure: A New Cycle Cover Theorem

In the area of distributed graph algorithms a number of network's entiti...

Please sign up or login with your details

Forgot password? Click here to reset