Routing Flow Through a Strongly Connected Graph

Erlebach, Hagerup
2002 Algorithmica  
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time su ces to send ow 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 new maximumow algorithm of Goldberg and Rao.
doi:10.1007/s00453-001-0082-y fatcat:xo5mfssd4nganl42dkydmv5gy4