Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion

René van Bevern

We introduce the s-Plex Cluster Vertex Deletion problem. Like the Cluster Vertex Deletion problem, it is NP-hard and motivated by graph-based data clustering. While the task in Clu…