A Polynomial Kernel for Diamond-Free Editing

03/09/2018
by   Yixin Cao, et al.
0

An H-free editing problem asks whether we can edit at most k edges to make a graph contain no induced copy of the fixed graph H. We obtain a polynomial kernel for this problem when H is a diamond. The incompressibility dichotomy for H being a 3-connected graph and the classical complexity dichotomy suggest that except for H being a complete/empty graph, H-free editing problems admit polynomial kernels only for a few small graphs H. Therefore, we believe that our result is an essential step toward a complete dichotomy on the compressibility of H-free editing. Additionally, we give a cubic-vertex kernel for the diamond-free edge deletion problem, which is far simpler than the previous kernel of the same size for the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2019

A Polynomial Kernel for Paw-Free Editing

For a fixed graph H, the H-free-editing problem asks whether we can modi...
research
04/24/2020

Incompressibility of H-free edge modification problems: Towards a dichotomy

Given a graph G and an integer k, the H-free Edge Editing problem is to ...
research
12/30/2022

A quasi-quadratic vertex Kernel for Cograph edge editing

We provide a O(k^2 log k) vertex kernel for cograph edge editing. This i...
research
05/18/2021

A cubic vertex-kernel for Trivially Perfect Editing

We consider the Trivially Perfect Editing problem, where one is given an...
research
06/29/2023

An improved kernelization algorithm for Trivially Perfect Editing

In the Trivially Perfect Editing problem one is given an undirected grap...
research
03/31/2020

Engineering Exact Quasi-Threshold Editing

Quasi-threshold graphs are {C_4, P_4}-free graphs, i.e., they do not con...
research
05/20/2021

(Sub)linear kernels for edge modification problems towards structured graph classes

In a (parameterized) graph edge modification problem, we are given a gra...

Please sign up or login with your details

Forgot password? Click here to reset