Uniform multicommodity flow through the complete graph with random edge-capacities.
David J. AldousColin McDiarmidAlex D. ScottPublished in: Oper. Res. Lett. (2009)
Keyphrases
- multicommodity flow
- undirected graph
- weighted graph
- multicommodity flow problems
- directed graph
- approximation algorithms
- spanning tree
- directed acyclic graph
- connected components
- edge detection
- random walk
- routing problem
- edge weights
- bipartite graph
- linear program
- graph theory
- graph structure
- minimum cost
- end to end
- complex networks
- neural network
- series parallel
- computational complexity
- lower bound
- sensor networks
- shortest path
- search strategies
- binary images