A cubic vertex-kernel for Trivially Perfect Editing

05/18/2021
by   Maël Dumas, et al.
0

We consider the Trivially Perfect Editing problem, where one is given an undirected graph G = (V,E) and a parameter k ∈ℕ and seeks to edit (add or delete) at most k edges from G to obtain a trivially perfect graph. The related Trivially Perfect Completion and Trivially Perfect Deletion problems are obtained by only allowing edge additions or edge deletions, respectively. Trivially perfect graphs are both chordal and cographs, and have applications related to the tree-depth width parameter and to social network analysis. All variants of the problem are known to be NP-Complete and to admit so-called polynomial kernels. More precisely, the existence of an O(k^3) vertex-kernel for Trivially Perfect Completion was announced by Guo (ISAAC 2007) but without a stand-alone proof. More recently, Drange and Pilipczuk (Algorithmica 2018) provided O(k^7) vertex-kernels for these problems and left open the existence of cubic vertex-kernels. In this work, we answer positively to this question for all three variants of the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/31/2022

Polynomial kernels for edge modification problems towards block and strictly chordal graphs

We consider edge modification problems towards block and strictly chorda...
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...
04/29/2021

Improved Kernels for Edge Modification Problems

In an edge modification problem, we are asked to modify at most k edges ...
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 ...
02/09/2022

The decision problem for perfect matchings in dense hypergraphs

Given 1≤ℓ <k and δ≥0, let PM(k,ℓ,δ) be the decision problem for the exis...
07/20/2019

Complexity of Modification Problems for Reciprocal Best Match Graphs

Reciprocal best match graphs (RBMGs) are vertex colored graphs whose ver...
01/07/2018

Perfect graphs with polynomially computable kernels

In a directed graph, a kernel is a subset of vertices that is both stabl...