Parameterized Complexity of List Coloring and Max Coloring

Aryanfard, Bardiya and Panolan, Fahad (2022) Parameterized Complexity of List Coloring and Max Coloring. In: 17th International Computer Science Symposium in Russia, CSR 2022, 29 June 2022through 1 July 2022, Virtual, Online.

Full text not available from this repository. (Request a copy)


In the List Coloring problem, the input is a graph G and list of colors L: V(G) → N for each vertex v∈ V(G). The objective is to test the existence of a coloring λ: V(G) → N such that for each v∈ V(G), λ(v) ∈ L(v) and for each edge (u, v) ∈ E(G), λ(u) ≠ λ(v). Fiala et al. (TCS 2011) proved that List Coloring is W[1]-hard when parameterized by the vertex cover number of the input graph. Recently, Gutin et al. (STACS 2020, SIDMA 2021) designed an O∗(2 k) time randomized algorithm for List Coloring where k is the size of the given clique modulator of the input graph. Since List Coloring is W[1]-hard parameterized by the vertex cover number, List Coloring is W[1]-hard parameterized by the size of a cluster modulator. In this work we study the problem parameteized by the size of ℓ -cluster modulator. That is, along with the input we are also given a vertex subset D such that G- D is cluster graph with ℓ connected components. We prove that assuming Exponential Time Hypothesis (ETH), List Coloring can not be solved in time f(|D|+ℓ)no(|D|+ℓlog|D|+ℓ) for any computable function f. In the Max Coloring problem, we are given a graph G and a weight function w: V(G) → N. For a proper coloring λ, the cost of λ is defined as follows. For each color i, w(i) is the maximum weight of a vertex colored i. Then, the cost of λ is ∑ i∈Cw(i), where C={λ(v)|v∈V(G)}. In the Max Coloring problem, our objective is to find a proper coloring with minimum cost. Araújo et al. (TCS 2018) proved that Max Coloring is W[1]-hard even on forests when parameterized by the size of the largest connected component in the input forest. Here, we prove that Max Coloring is FPT with respect to parameters (i) the size of a vertex cover, (ii) the size of a clique modulator, and (iii) the size of a 2-cluster modulator. © 2022, Springer Nature Switzerland AG.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Panolan, Fahad
Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Exponential Time Hypothesis; Fixed Parameter Tractability; Graph Coloring; Randomized algorithms; Reduction
Subjects: Computer science
Divisions: Department of Computer Science & Engineering
Depositing User: . LibTrainee 2021
Date Deposited: 15 Oct 2022 06:27
Last Modified: 15 Oct 2022 06:27
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 10958 Statistics for this ePrint Item