Fully Dynamic Correlation Clustering with Vertex Updates in Polylogarithmic Update TimeResearch Paper
Correlation clustering asks for a partition of the vertices of a complete graph whose edges are labelled (similar) or (dissimilar), minimizing the number of disagreements: edges between clusters plus edges inside clusters. Introduced by Bansal, Blum and Chawla (DOI 10.1023/B:MACH.0000033116.57574.95), it is a standard model for…