20 citations · 31 across the 6 of their papers we have counts for
7 papers · 1 filter
Local Algorithms for Finding Densely Connected Clusters
Peter Macgregor, He Sun
Local graph clustering is an important algorithmic technique for analysing massive graphs, and has been widely applied in many research fields of data science. While the objective…
Augmenting the Algebraic Connectivity of Graphs
Bogdan-Adrian Manghiuc, Pan Peng, He Sun
For any undirected graph and a set of candidate edges with , the -spectral augmentability problem is to find a set of edges from…
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg +4
Designing dynamic graph algorithms against an adaptive adversary is a major goal in the field of dynamic graph algorithms. While a few such algorithms are known for spanning trees,…
Distributed Graph Clustering and Sparsification
He Sun, Luca Zanetti
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the…
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification
Yin Tat Lee, He Sun
For any undirected and weighted graph with vertices and edges, we call a sparse subgraph of , with proper reweighting of the edges, a -s…
Communication-Optimal Distributed Clustering
Jiecao Chen, He Sun, David P. Woodruff +1
Clustering large datasets is a fundamental problem with a number of applications in machine learning. Data is often collected on different sites and clustering needs to be performe…