Parameterizing Cluster Editing by the Number of Deletions

Vincent Froese, Leon Kellerhals, Frank Sommer +2

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…