12 citations · 17 across the 6 of their papers we have counts for
6 papers
-norm Flow Diffusion in Near-Linear Time
Li Chen, Richard Peng, Di Wang
Diffusion is a fundamental graph procedure and has been a basic building block in a wide range of theoretical and empirical applications such as graph partitioning and semi-supervi…
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
Jan van den Brand, Yin-Tat Lee, Danupon Nanongkai +5
We present an -time randomized algorithm for maximum cardinality bipartite matching and related problems (e.g. transshipment, negative-weight shortest paths, a…
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…
Faster width-dependent algorithm for mixed packing and covering LPs
Digvijay Boob, Saurabh Sawlani, Di Wang
In this paper, we give a faster width-dependent algorithm for mixed packing-covering LPs. Mixed packing-covering LPs are fundamental to combinatorial optimization in computer scien…
Flows in Almost Linear Time via Adaptive Preconditioning
Rasmus Kyng, Richard Peng, Sushant Sachdeva +1
We present algorithms for solving a large class of flow and regression problems on unit weighted graphs to accuracy in almost-linear time. These problems includ…
Expander Decomposition and Pruning: Faster, Stronger, and Simpler
Thatchaphol Saranurak, Di Wang
We study the problem of graph clustering where the goal is to partition a graph into clusters, i.e. disjoint subsets of vertices, such that each cluster is well connected internall…