A unified algorithm for colouring graphs of bounded clique-width
Computational Complexity
2021-08-13 v2 Data Structures and Algorithms
Abstract
Clique-width is one of the graph complexity measures leading to polynomial special-case algorithms for generally NP-complete problems, e.g. graph colourability. The best two currently known algorithms for verifying c-colourability of graphs represented as clique-width terms are optimised towards two different extreme cases, a constant number of colours and a very large number of colours. We present a way to unify these approaches in a single relatively simple algorithm that achieves the state of the art complexity in both cases. The unified algorithm also provides a speed-up for a large number of colours.
Keywords
Cite
@article{arxiv.2008.07468,
title = {A unified algorithm for colouring graphs of bounded clique-width},
author = {Bruno Courcelle and Irène Durand and Michael Raskin},
journal= {arXiv preprint arXiv:2008.07468},
year = {2021}
}