On the (non-)existence of polynomial kernels for $P_l$-free edge modification problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Algorithmica Year : 2013

On the (non-)existence of polynomial kernels for $P_l$-free edge modification problems


Given a graph $G=(V,E)$ and a positive integer $k$, an edge modification problem for a graph property $\Pi$ consists in deciding whether there exists a set $F$ of pairs of $V$ of size at most $k$ such that the graph $H=(V,E\vartriangle F)$ satisfies the property $\Pi$. In the $\Pi$ \emph{edge-completion problem}, the set $F$ is constrained to be disjoint from $E$; in the $\Pi$ \emph{edge-deletion problem}, $F$ is a subset of $E$; no constraint is imposed on $F$ in the $\Pi$ \emph{edge-editing problem}. A number of optimization problems can be expressed in terms of graph modification problems which have been extensively studied in the context of parameterized complexity. When parameterized by the size $k$ of the set $F$, it has been proved that if $\Pi$ is an hereditary property characterized by a finite set of forbidden induced subgraphs, then the three $\Pi$ edge-modification problems are FPT. It was then natural to ask whether these problems also admit a polynomial kernel. Using recent lower bound techniques, Kratsch and Wahlström answered this question negatively. However, the problem remains open on many natural graph classes characterized by forbidden induced subgraphs. Kratsch and Wahlström asked whether the result holds when the forbidden subgraphs are paths or cycles and pointed out that the problem is already open in the case of $P_4$-free graphs (i.e. cographs). This paper provides positive and negative results in that line of research. We prove that \textsc{Parameterized cograph edge-modification} problems have cubic vertex kernels whereas polynomial kernels are unlikely to exist for the \textsc{$P_l$-free edge-deletion} and the \textsc{$C_l$-free edge-deletion} problems for $l\geq 7$ and $l\geq 4$ respectively. Indeed, if they exist, then $NP \subseteq coNP / poly$.
Fichier principal
Vignette du fichier
rr-cograph-kernel-2.pdf (294.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00821612 , version 1 (23-10-2016)



Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez. On the (non-)existence of polynomial kernels for $P_l$-free edge modification problems. Algorithmica, 2013, 65 (4), pp.900-926. ⟨10.1007/s00453-012-9619-5⟩. ⟨hal-00821612⟩
405 View
200 Download



Gmail Facebook Twitter LinkedIn More