Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

ALGORITHMICA
2002

favoriteEmaildiscussreport

71views more ALGORITHMICA 2002»

Routing Flow Through a Strongly Connected Graph

13 years 4 months ago

Routing Flow Through a Strongly Connected Graph

Download www.cs.princeton.edu

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

Real-time Traffic

ALGORITHMICA 2002 | Linear Time Suffices | Source Vertices | Strongly Connected |

claim paper

Related Content

» Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links

» Strong Formulations for 2NodeConnected Steiner Network Problems

» Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems

» Anonymous Connections and Onion Routing

» Memory Requirements for Local Geometric Routing and Traversal in Digraphs

» Multilayer ObstacleAvoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

» Flow Web a graph based user interface for 3D flow field exploration

» Exploring the Local Connectivity Preference in Internet AS Level Topology

» Onion Routing

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2002
Where	ALGORITHMICA
Authors	Thomas Erlebach, Torben Hagerup

Comments (0)