A Polynomial Kernel for Paw-Free Editing

11/09/2019
by   Eduard Eiben, et al.
0

For a fixed graph H, the H-free-editing problem asks whether we can modify a given graph G by adding or deleting at most k edges such that the resulting graph does not contain H as an induced subgraph. The problem is known to be NP-complete for all fixed H with at least 3 vertices and it admits a 2^O(k)n^O(1) algorithm. Cai and Cai showed that the H-free-editing problem does not admit a polynomial kernel whenever H or its complement is a path or a cycle with at least 4 edges or a 3-connected graph with at least 1 edge missing. Their results suggest that if H is not independent set or a clique, then H-free-editing admits polynomial kernels only for few small graphs H, unless coNP∈NP/poly. Therefore, resolving the kernelization of H-free-editing for small graphs H plays a crucial role in obtaining a complete dichotomy for this problem. In this paper, we positively answer the question of compressibility for one of the last two unresolved graphs H on 4 vertices. Namely, we give the first polynomial kernel for paw-free editing with O(k^6)vertices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2018

A Polynomial Kernel for Diamond-Free Editing

An H-free editing problem asks whether we can edit at most k edges to ma...
research
10/14/2022

(1,1)-Cluster Editing is Polynomial-time Solvable

A graph H is a clique graph if H is a vertex-disjoin union of cliques. A...
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
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
06/29/2023

An improved kernelization algorithm for Trivially Perfect Editing

In the Trivially Perfect Editing problem one is given an undirected grap...
research
02/09/2022

Counting Kernels in Directed Graphs with Arbitrary Orientations

A kernel of a directed graph is a subset of vertices that is both indepe...
research
08/16/2022

Polynomial kernel for immersion hitting in tournaments

For a fixed simple digraph H without isolated vertices, we consider the ...

Please sign up or login with your details

Forgot password? Click here to reset