Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC ’11
Jonathan A. Kelner
Shang-Hua Teng
Daniel A. Spielman
Paul Christiano
A new approach to computing maximum flows using electrical flows