Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

28 Sep 2015  ·  Berkholz Christoph, Bonsma Paul, Grohe Martin ·

An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to find a stable colouring that uses a minimum number of colours... This is a widely used subroutine for graph isomorphism testing algorithms, since any automorphism needs to be colour preserving. We give an $O((m+n)\log n)$ algorithm for finding a canonical version of such a stable colouring, on graphs with $n$ vertices and $m$ edges. We show that no faster algorithm is possible, under some modest assumptions about the type of algorithm, which captures all known colour refinement algorithms. read more

PDF Abstract
No code implementations yet. Submit your code now

Categories


Data Structures and Algorithms Computational Complexity

Datasets


  Add Datasets introduced or used in this paper