DeepAI
Log In Sign Up

Parameterized Complexity of Maximum Edge Colorable Subgraph

08/18/2020
by   Akanksha Agrawal, et al.
0

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 ⊆.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/20/2020

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...
04/19/2019

On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem

A k-edge-coloring of a graph is an assignment of colors {1,...,k} to edg...
02/06/2018

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials

The theory of kernelization can be used to rigorously analyze data reduc...
05/01/2019

Parameterized Complexity of Conflict-free Graph Coloring

Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-...
01/10/2019

On the Descriptive Complexity of Color Coding

Color coding is an algorithmic technique used in parameterized complexit...
04/05/2019

Average Sensitivity of Graph Algorithms

In modern applications of graphs algorithms, where the graphs of interes...
11/06/2017

Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity

In the past 30 years, results regarding special classes of integer linea...