On Structural Parameterizations of Load Coloring

10/11/2020
by   I. Vinod Reddy, et al.
0

Given a graph G and a positive integer k, the 2-Load coloring problem is to check whether there is a 2-coloring f:V(G) →{r,b} of G such that for every i ∈{r,b}, there are at least k edges with both end vertices colored i. It is known that the problem is NP-complete even on special classes of graphs like regular graphs. Gutin and Jones (Inf Process Lett 114:446-449, 2014) showed that the problem is fixed-parameter tractable by giving a kernel with at most 7k vertices. Barbero et al. (Algorithmica 79:211-229, 2017) obtained a kernel with less than 4k vertices and O(k) edges, improving the earlier result. In this paper, we study the parameterized complexity of the problem with respect to structural graph parameters. We show that cannot be solved in time f(w)n^o(w), unless ETH fails and it can be solved in time n^O(w), where n is the size of the input graph, w is the clique-width of the graph and f is an arbitrary function of w. Next, we consider the parameters distance to cluster graphs, distance to co-cluster graphs and distance to threshold graphs, which are weaker than the parameter clique-width and show that the problem is fixed-parameter tractable (FPT) with respect to these parameters. Finally, we show that is NP-complete even on bipartite graphs and split graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/23/2019

Parameterized Coloring Problems on Threshold Graphs

In this paper, we study several coloring problems on graphs from the vie...
research
03/10/2020

Maximizing Happiness in Graphs of Bounded Clique-Width

Clique-width is one of the most important parameters that describes stru...
research
10/27/2021

Structural Parameterizations of Budgeted Graph Coloring

We introduce a variant of the graph coloring problem, which we denote as...
research
09/01/2023

The Complexity of Cluster Vertex Splitting and Company

Clustering a graph when the clusters can overlap can be seen from three ...
research
11/17/2021

Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring

We consider the algorithmic complexity of recognizing bipartite temporal...
research
04/19/2022

A Fixed-Parameter Algorithm for the Schrijver Problem

The Schrijver graph S(n,k) is defined for integers n and k with n ≥ 2k a...
research
02/11/2019

Fixed-Parameter Tractable Algorithms for Corridor Guarding Problems

Given an orthogonal connected arrangement of line-segments, Minimum Corr...

Please sign up or login with your details

Forgot password? Click here to reset