DeepAI AI Chat
Log In Sign Up

Component twin-width as a parameter for BINARY-CSP and its semiring generalisations

by   Ambroise Baril, et al.

We investigate the fine-grained and the parameterized complexity of several generalizations of binary constraint satisfaction problems (BINARY-CSPs), that subsume variants of graph colouring problems. Our starting point is the observation that several algorithmic approaches that resulted in complexity upper bounds for these problems, share a common structure. We thus explore an algebraic approach relying on semirings that unifies different generalizations of BINARY-CSPs (such as the counting, the list, and the weighted versions), and that facilitates a general algorithmic approach to efficiently solving them. The latter is inspired by the (component) twin-width parameter introduced by Bonnet et al., which we generalize via edge-labelled graphs in order to formulate it to arbitrary binary constraints. We consider input instances with bounded component twin-width, as well as constraint templates of bounded component twin-width, and obtain an FPT algorithm as well as an improved, exponential-time algorithm, for broad classes of binary constraints. We illustrate the advantages of this framework by instantiating our general algorithmic approach on several classes of problems (e.g., the H-coloring problem and its variants), and showing that it improves the best complexity upper bounds in the literature for several well-known problems.


On algorithmic applications of sim-width and mim-width of (H_1, H_2)-free graphs

Mim-width and sim-width are among the most powerful graph width paramete...

Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems

Constraint satisfaction problems (CSPs) are an important formal framewor...

Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds

The goal of this work is to give precise bounds on the counting complexi...

Generalized distance domination problems and their complexity on graphs of bounded mim-width

We generalise the family of (σ, ρ)-problems and locally checkable vertex...

Classes of intersection digraphs with good algorithmic properties

An intersection digraph is a digraph where every vertex v is represented...

Impossibility Theorems and the Universal Algebraic Toolkit

We elucidate a close connection between the Theory of Judgment Aggregati...

Promise Constraint Satisfaction and Width

We study the power of the bounded-width consistency algorithm in the con...