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

european symposium on algorithms, Volume 60, Issue 4, 2017, Pages 581-614.

Cited by: 44|Bibtex|Views7|Links
EI
Keywords:
Graph isomorphismColour refinementPartition refinementCanonical labelling

Abstract:

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 ...More

Code:

Data:

Your rating :
0

 

Tags
Comments