Abstract
It is shown that, for every strongly connected network in which every edge has capacity at least Δ , linear time suffices to send flow from source vertices, each with a given supply, to sink vertices, each with a given demand, provided that the total supply equals the total demand and is bounded by Δ . This problem arises in a maximum-flow algorithm of Goldberg and Rao, the binary blocking flow algorithm.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Erlebach, Hagerup Routing Flow Through a Strongly Connected Graph . Algorithmica 32, 467–473 (2002). https://doi.org/10.1007/s00453-001-0082-y
Issue Date:
DOI: https://doi.org/10.1007/s00453-001-0082-y