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

by   Niels Grüttemeier, et al.

Given an undirected graph G and integers c and k, the Maximum Edge-Colorable Subgraph problem asks whether we can delete at most k edges in G to obtain a graph that has a proper edge coloring with at most c colors. We show that Maximum Edge-Colorable Subgraph admits, for every fixed c, a linear-size problem kernel when parameterized by the edge deletion distance of G to a graph with maximum degree c-1. This parameterization measures the distance to instances that, due to Vizing's famous theorem, are trivial yes-instances. For c< 4, we also provide a linear-size kernel for the same parameterization for Multi Strong Triadic Closure, a related edge coloring problem with applications in social network analysis. We provide further results for Maximum Edge-Colorable Subgraph parameterized by the vertex deletion distance to graphs where every component has order at most c and for the list-colored versions of both problems.



There are no comments yet.


page 1

page 2

page 3

page 4


Parameterized Aspects of Strong Subgraph Closure

Motivated by the role of triadic closures in social networks, and the im...

Parameterized Complexity of Maximum Edge Colorable Subgraph

A graph H is p-edge colorable if there is a coloring ψ: E(H) →{1,2,…,p},...

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

On the Relation of Strong Triadic Closure and Cluster Deletion

We study the parameterized and classical complexity of two related probl...

Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors

Given an undirected graph G=(V,E) the NP-hard Strong Triadic Closure (ST...

Average Sensitivity of Graph Algorithms

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

Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies

We consider the Π-free Deletion problem parameterized by the size of a v...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.