On the Complexity of 2-club Cluster Editing with Vertex Splitting

Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann +1

Editing a graph to obtain a disjoint union of s-clubs is one of the models for correlation clustering, which seeks a partition of the vertex set of a graph so that elements of each…