In Cluster Editing, we are given a graph $G$ and an integer $k$ and ask whether at most $k$ edge insertions and deletions turn $G$ into a disjoint union of cliques. Komusiewicz and Niedermeier asked in 2012 at MFCS whether Cluster Editing is fixed-parameter tractable with respect to the number $\ell$ of edge deletions, a parameter based on the solution rather than on the structure of the input graph. We answer this question negatively: Cluster Editing with at most $k$ edits, at most $\ell$ of which are deletions, is W[1]-hard with respect to $\ell$, even when combined with the pathwidth and the feedback edge set number of the input graph. The hardness extends to editing towards $H$-free graphs for every graph $H$ that is a clique minus one edge on at least four vertices. On the positive side, we show that the problem becomes fixed-parameter tractable when $\ell$ is combined with the excess $μ$ of $k$ over the lower bound given by a packing of modification-disjoint induced paths on three vertices, a lower bound that state-of-the-art solvers use. Each of the two parameters alone leads to intractability, but together they admit an $O(4^{μ+\ell}\cdot(n+m+μ))$-time algorithm and a problem kernel with $O((\ell+μ)^2)$ vertices. Both results extend to packings of stars and the algorithm extends to $H$-free editing.

翻译：暂无翻译