Correlation Clustering: Let All The Flowers Bloom!

Correlation clustering is a NP-hard problem, and for large signed graphs finding even just a good approximation of the optimal solution is a hard task. In this article we examine the effect of ranking the nodes and processing them in order of ranks. We demonstrate that based on the rate of positive edges in the graph it is worth using different optimisation methods. We show that all building blocks of our methods are necessary under certain circumstances.