research
∙
10/15/2019
Flowless: Extracting Densest Subgraphs Without Flow Computations
We propose a simple and computationally efficient method for dense subgr...
share
research
∙
07/05/2019
Near-Optimal Fully Dynamic Densest Subgraph
We give the first fully dynamic algorithm which maintains a (1+ϵ)-approx...
research
∙
05/30/2018
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
We develop a framework for graph sparsification and sketching, based on ...
research
∙
04/11/2018
Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Motivated by the study of matrix elimination orderings in combinatorial ...
research
∙
11/22/2017
