Efficient Algorithms and Complexity for Overlapping Graph Clustering via Vertex Splitting

The core message of this article is that the problems of Sigma Clique Cover (SCC), Cluster Vertex Splitting (CVS), and Cluster Editing with Vertex Splitting (CEVS) are all NP-complete, but CVS admits a linear-size problem kernel.