Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs

Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun

This paper presents two efficient hierarchical clustering (HC) algorithms with respect to Dasgupta's cost function. For any input graph $G$ with a clear cluster-structure, our desi…