DeepAI AI Chat
Log In Sign Up

Maximizing Happiness in Graphs of Bounded Clique-Width

by   Ivan Bliznets, et al.

Clique-width is one of the most important parameters that describes structural complexity of a graph. Probably, only treewidth is more studied graph width parameter. In this paper we study how clique-width influences the complexity of the Maximum Happy Vertices (MHV) and Maximum Happy Edges (MHE) problems. We answer a question of Choudhari and Reddy '18 about parameterization by the distance to threshold graphs by showing that MHE is NP-complete on threshold graphs. Hence, it is not even in XP when parameterized by clique-width, since threshold graphs have clique-width at most two. As a complement for this result we provide a n^O(ℓ·cw) algorithm for MHE, where ℓ is the number of colors and cw is the clique-width of the input graph. We also construct an FPT algorithm for MHV with running time O^*((ℓ+1)^O(cw)), where ℓ is the number of colors in the input. Additionally, we show O(ℓ n^2) algorithm for MHV on interval graphs.


page 1

page 2

page 3

page 4


Structural Parameterizations of Clique Coloring

A clique coloring of a graph is an assignment of colors to its vertices ...

Target Set Selection Parameterized by Clique-Width and Maximum Threshold

The Target Set Selection problem takes as an input a graph G and a non-n...

Clique-Width and Directed Width Measures for Answer-Set Programming

Disjunctive Answer Set Programming (ASP) is a powerful declarative progr...

On tradeoffs between width- and fill-like graph parameters

In this work we consider two two-criteria optimization problems: given a...

On Structural Parameterizations of Load Coloring

Given a graph G and a positive integer k, the 2-Load coloring problem is...

A unified algorithm for colouring graphs of bounded clique-width

Clique-width is one of the graph complexity measures leading to polynomi...

The Algorithmic Complexity of Tree-Clique Width

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