Bogdan-Adrian Manghiuc

activity

20202023

most citedNearly-Optimal Hierarchical Clustering for Well-Clustered Graphs

2 citations · 3 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DS2023★ 2 cited

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…

cs.DS2021★ 1 cited

Hierarchical Clustering: $O (1)$ -Approximation for Well-Clustered Graphs

Bogdan-Adrian Manghiuc, He Sun

Hierarchical clustering studies a recursive partition of a data set into clusters of successively smaller size, and is a fundamental problem in data analysis. In this work we study…

cs.DS2020

Augmenting the Algebraic Connectivity of Graphs

Bogdan-Adrian Manghiuc, Pan Peng, He Sun

For any undirected graph $G = (V, E)$ and a set $E_{W}$ of candidate edges with $E \cap E_{W} = \emptyset$ , the $(k, γ)$ -spectral augmentability problem is to find a set $F$ of $k$ edges from…

Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs

Hierarchical Clustering: O(1)-Approximation for Well-Clustered Graphs

Augmenting the Algebraic Connectivity of Graphs

Hierarchical Clustering: $O (1)$ -Approximation for Well-Clustered Graphs