research
∙
01/14/2021
Spectral Clustering Oracles in Sublinear Time
Given a graph G that can be partitioned into k disjoint expanders with o...
share
research
∙
03/28/2019
Faster Spectral Sparsification in Dynamic Streams
Graph sketching has emerged as a powerful technique for processing massi...
research
∙
08/14/2018
Testing Graph Clusterability: Algorithms and Lower Bounds
We consider the problem of testing graph cluster structure: given access...
research
∙
08/06/2018
