Correlation clustering: divide and conquer
László Aszalós, Mária Bakó · Annals of Computer Science and Information Systems · 2016
The correlation clustering is an NP-hard problem, hence its solving methods do not scale well.The contraction method and its improvement enable us to construct a divide and conquer algorithm, which could help us to clustering bigger sets.In this article we present the contraction method and compare the effectiveness of this new new and our old methods.