20 citations · 31 across the 7 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.LG2020★ 2 cited
Higher-Order Spectral Clustering of Directed Graphs
Steinar Laenen, He Sun
Clustering is an important topic in algorithms, and has a number of applications in machine learning, computer vision, statistics, and several other research disciplines. Tradition…
cs.DS2020
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…
cs.DS2020
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,…