Login / Signup

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

Paul F. ChristianoJonathan A. KelnerAleksander MadryDaniel A. SpielmanShang-Hua Teng
Published in: STOC (2011)
Keyphrases
  • maximum flow
  • directed graph
  • approximation algorithms
  • undirected graph
  • image processing
  • computational complexity
  • graph structure
  • directed acyclic graph
  • dynamic programming
  • spanning tree