DeepAI AI Chat
Log In Sign Up

Computing the Chromatic Number Using Graph Decompositions via Matrix Rank

by   Bart M. P. Jansen, et al.
TU Eindhoven

Computing the smallest number q such that the vertices of a given graph can be properly q-colored is one of the oldest and most fundamental problems in combinatorial optimization. The q-Coloring problem has been studied intensively using the framework of parameterized algorithmics, resulting in a very good understanding of the best-possible algorithms for several parameterizations based on the structure of the graph. While there is an abundance of work for parameterizations based on decompositions of the graph by vertex separators, almost nothing is known about parameterizations based on edge separators. We fill this gap by studying q-Coloring parameterized by cutwidth, and parameterized by pathwidth in bounded-degree graphs. Our research uncovers interesting new ways to exploit small edge separators. We present two algorithms for q-Coloring parameterized by cutwidth cutw: a deterministic one that runs in time O^*(2^ω· cutw), where ω is the matrix multiplication constant, and a randomized one with runtime O^*(2^cutw). In sharp contrast to earlier work, the running time is independent of q. The dependence on cutwidth is optimal: we prove that even 3-Coloring cannot be solved in O^*((2-ε)^cutw) time assuming the Strong Exponential Time Hypothesis (SETH). Our algorithms rely on a new rank bound for a matrix that describes compatible colorings. Combined with a simple communication protocol for evaluating a product of two polynomials, this also yields an O^*(( d/2+1)^pw) time randomized algorithm for q-Coloring on graphs of pathwidth pw and maximum degree d. Such a runtime was first obtained by Björklund, but only for graphs with few proper colorings. We also prove that this result is optimal in the sense that no O^*(( d/2+1-ε)^pw)-time algorithm exists assuming SETH.


page 1

page 2

page 3

page 4


Fast algorithms for Vizing's theorem on bounded degree graphs

Vizing's theorem states that every graph G of maximum degree Δ can be pr...

Breaking the 2^n barrier for 5-coloring and 6-coloring

The coloring problem (i.e., computing the chromatic number of a graph) c...

Edge-Coloring Algorithms for Bounded Degree Multigraphs

In this paper, we consider algorithms for edge-coloring multigraphs G of...

Dominator Coloring and CD Coloring in Almost Cluster Graphs

In this paper, we study two popular variants of Graph Coloring – Dominat...

3-Coloring in Time O(1.3217^n)

We propose a new algorithm for 3-coloring that runs in time O(1.3217^n)....

Discrepancy Minimization in Input-Sparsity Time

A recent work of Larsen [Lar23] gave a faster combinatorial alternative ...

More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization

Dynamic optimization problems have gained significant attention in evolu...