Sciweavers

Share
ALGORITHMICA
2002

Routing Flow Through a Strongly Connected Graph

8 years 5 months ago
Routing Flow Through a Strongly Connected Graph
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. KeyWords. Analysisofalgorithms,Networkflow,Maximum-flowproblem,Feasible-flowproblem,Strongly connected graph, Depth-first search.
Thomas Erlebach, Torben Hagerup
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2002
Where ALGORITHMICA
Authors Thomas Erlebach, Torben Hagerup
Comments (0)
books