2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2019★ 2 cited
Flowless: Extracting Densest Subgraphs Without Flow Computations
Digvijay Boob, Yu Gao, Richard Peng +4
We propose a simple and computationally efficient method for dense subgraph discovery, which is a classic problem both in theory and in practice. It is well known that dense subgra…
cs.DS2019
Near-Optimal Fully Dynamic Densest Subgraph
Saurabh Sawlani, Junxing Wang
We give the first fully dynamic algorithm which maintains a -approximate densest subgraph in worst-case time per update. Dense subgraph discove…
cs.DS2017
On Computing Min-Degree Elimination Orderings
Matthew Fahrbach, Gary L. Miller, Richard Peng +3
We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination. This ordering is based on viewing the non-zero elements of a symmetric p…