1 citations · 1 across the 4 of their papers we have counts for
4 papers
Generalized Flow in Nearly-linear Time on Moderately Dense Graphs
Shunhua Jiang, Michael Kapralov, Lawrence Li +1
In this paper we consider generalized flow problems where there is an -edge -node directed graph and each edge has a loss factor governing whet…
Fast Algorithms for Separable Linear Programs
Sally Dong, Gramoz Goranci, Lawrence Li +2
In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A promi…
A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs
Lawrence Li, Sushant Sachdeva
We demonstrate that for expander graphs, for all there exists a data structure of size which can be used to return -approximations to effe…
How fast can you update your MST? (Dynamic algorithms for cluster computing)
Seth Gilbert, Lawrence Li
Imagine a large graph that is being processed by a cluster of computers, e.g., described by the -machine model or the Massively Parallel Computation Model. The graph, however, i…