On the Parameterized Complexity of the $s$-Club Cluster Edge Deletion Problem

Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli +1

We study the parameterized complexity of the $s$-Club Cluster Edge Deletion problem: Given a graph $G$ and two integers $s\ge 2$ and $k\ge 1$, is it possible to remove at most $k…