A Faster Isomorphism Test for Graphs of Small Degree

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

Luks's algorithm (JCSS 1982) to test isomorphism of bounded degree graphs in polynomial time is one of the 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 particular, for graphs of logarithmic degree, Babai's quasipolynomial isomorphism test (STOC 2016) essentially boils down to Luks's algorithm, and any improvement of Babai's algorithm requires an improved isomorphism test for graphs of (poly)logarithmic degree. In this work, we obtain such an improvement: we give an algorithm that solves the Graph Isomorphism Problem in time n^O(( d)^c), where n is the number of vertices of the input graphs, d is the maximum degree of the input graphs, and c is an absolute constant. The best previous isomorphism test for graphs of maximum degree d due to Babai, Kantor and Luks (FOCS 1983) runs in time n^O(d/ d). Our result generalizes the quasipolynomial-time algorithm for the general isomorphism problem due to Babai.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2018

Towards faster isomorphism tests for bounded-degree graphs

Luks' algorithm (JCSS 1982) to test isomorphism of bounded degree graphs...
research
02/21/2018

MIS in the Congested Clique Model in O( Δ) Rounds

We give a maximal independent set (MIS) algorithm that runs in O(Δ) roun...
research
11/22/2017

Solving Graph Isomorphism Problem for a Special case

Graph isomorphism is an important computer science problem. The problem ...
research
05/09/2019

Linear Work Generation of R-MAT Graphs

R-MAT is a simple, widely used recursive model for generating `complex n...
research
05/01/2018

Spectrally Robust Graph Isomorphism

We initiate the study of spectral generalizations of the graph isomorphi...
research
11/21/2022

Algorithmic Applications of Hypergraph and Partition Containers

We present a general method to convert algorithms into faster algorithms...
research
10/11/2012

Improved Graph Clustering

Graph clustering involves the task of dividing nodes into clusters, so t...

Please sign up or login with your details

Forgot password? Click here to reset