1 paper
Manuel Lafond, Alitzel López Sánchez, Weidong Luo
In the Cluster Editing problem, sometimes known as (unweighted) Correlation Clustering, we must insert and delete a minimum number of edges to achieve a graph in which every connec…