Parameterized Complexity of Maximum Edge Colorable Subgraph

by   Akanksha Agrawal, et al.

A graph H is p-edge colorable if there is a coloring ψ: E(H) →{1,2,…,p}, such that for distinct uv, vw ∈ E(H), we have ψ(uv) ≠ψ(vw). The Maximum Edge-Colorable Subgraph problem takes as input a graph G and integers l and p, and the objective is to find a subgraph H of G and a p-edge-coloring of H, such that |E(H)| ≥ l. We study the above problem from the viewpoint of Parameterized Complexity. We obtain algorithms when parameterized by: (1) the vertex cover number of G, by using Integer Linear Programming, and (2) l, a randomized algorithm via a reduction to Rainbow Matching, and a deterministic algorithm by using color coding, and divide and color. With respect to the parameters p+k, where k is one of the following: (1) the solution size, l, (2) the vertex cover number of G, and (3) l - (G), where (G) is the size of a maximum matching in G; we show that the (decision version of the) problem admits a kernel with 𝒪(k · p) vertices. Furthermore, we show that there is no kernel of size 𝒪(k^1-ϵ· f(p)), for any ϵ > 0 and computable function f, unless ⊆.


page 1

page 2

page 3

page 4


Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs

Given an undirected graph G and integers c and k, the Maximum Edge-Color...

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem

A vertex of a plane digraph is bimodal if all its incoming edges (and he...

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials

The theory of kernelization can be used to rigorously analyze data reduc...

Dominator Coloring and CD Coloring in Almost Cluster Graphs

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

Parameterized Power Vertex Cover

We study a recently introduced generalization of the Vertex Cover (VC) p...

Parameterized Results on Acyclic Matchings with Implications for Related Problems

A matching M in a graph G is an acyclic matching if the subgraph of G in...

Average Sensitivity of Graph Algorithms

In modern applications of graphs algorithms, where the graphs of interes...

Please sign up or login with your details

Forgot password? Click here to reset