Routing Flow Through a Strongly Connected Graph.

Thomas Erlebach Torben Hagerup

Published in: Algorithmica (2002)

Keyphrases

strongly connected
directed graph
optimum path forest
undirected graph
random walk
structured data
end to end
flow field
objective function
support vector
routing protocol
ad hoc networks
routing algorithm
graph structure
maximum flow