A unified algorithm for colouring graphs of bounded clique-width

08/17/2020
by   Bruno Courcelle, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/05/2020

Clique-Width: Harnessing the Power of Atoms

Many NP-complete graph problems are polynomially solvable on graph class...
11/03/2021

The Algorithmic Complexity of Tree-Clique Width

Tree-width has been proven to be a useful parameter to design fast and e...
04/05/2020

Clique-Width of Point Configurations

While structural width parameters (of the input) belong to the standard ...
04/10/2020

Bounding the Mim-Width of Hereditary Graph Classes

A large number of NP-hard graph problems become polynomial-time solvable...
03/06/2022

Locally checkable problems in bounded clique-width graphs

We continue the study initiated by Bonomo-Braberman and Gonzalez in 2020...
07/12/2017

Fast exact algorithms for some connectivity problems parametrized by clique-width

Given a clique-width expression of a graph G of clique-width k, we provi...
08/15/2019

Tracking Paths in Planar Graphs

We consider the NP-complete problem of tracking paths in a graph, first ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.