Computing Maximum Flow with Augmenting Electrical Flows
We present an Õ (m[superscript 10/7] U[superscript 1/7])-time algorithm for the maximum s-t flow problem (and the minimum s-t cut problem) in directed graphs with m arcs and largest integer capacity U. This matches the running time of the Õ (mU)[superscript 10/7])- time algorithm of Madry [30] in...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2017
|
| Online Access: | http://hdl.handle.net/1721.1/111684 https://orcid.org/0000-0003-0536-0323 |