Sciweavers

ALGORITHMICA
2002
71views more  ALGORITHMICA 2002»
13 years 11 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,...
Thomas Erlebach, Torben Hagerup