Uniform multicommodity flow through the complete graph with random edge-capacities.
Give random capacities C to the edges of the complete n-vertex graph. Consider the maximum flow Φ n that can be simultaneously routed between each source-destination pair. We prove that Φ n → φ{symbol} in probability where the limit constant φ{symbol}...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2009
|