2 research outputs found
Cluster Editing parameterized above the size of a modification-disjoint packing is para-NP-hard
Given a graph and an integer , the Cluster Editing problem asks
whether we can transform into a union of vertex-disjoint cliques by at most
modifications (edge deletions or insertions). In this paper, we study the
following variant of Cluster Editing. We are given a graph , a packing
of modification-disjoint induced s (no pair of s in
share an edge or non-edge) and an integer . The task is to
decide whether can be transformed into a union of vertex-disjoint cliques
by at most modifications (edge deletions or insertions). We
show that this problem is NP-hard even when (in which case the problem
asks to turn into a disjoint union of cliques by performing exactly one
edge deletion or insertion per element of ). This answers negatively a
question of van Bevern, Froese, and Komusiewicz (CSR 2016, ToCS 2018), repeated
by Komusiewicz at Shonan meeting no. 144 in March 2019.Comment: 18 pages, 5 figure