A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs

2011
*
Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11
*

We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a system of linear equations in a Laplacian matrix, and thus may be approximately computed in nearly-linear time. Using this approach, we develop the fastest known algorithm for computing approximately maximum s-t flows. For a graph having n vertices and m edges,

doi:10.1145/1993636.1993674
dblp:conf/stoc/ChristianoKMST11
fatcat:7mkiyrop5be2riqfq6buentjuq