Uniform multicommodity flow through the complete graph with random edge-capacities
DOI10.1016/J.ORL.2009.04.008zbMATH Open1227.05158OpenAlexW2124501739MaRDI QIDQ1038093FDOQ1038093
Authors: David Aldous, Colin McDiarmid, Alex Scott 
Publication date: 17 November 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/0h2400bt
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21) Stochastic network models in operations research (90B15)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Near perfect coverings in graphs and hypergraphs
- First-passage percolation, network flows and electrical resistances
- Bulk transport properties and exponent inequalities for random resistor and flow networks
- Integer and fractional packings in dense graphs
- Dynamic Routing in Fully Connected Networks
- Cost-volume relationship for flows through a disordered network
- Surfaces with minimal random weights and maximal flows: a higher dimensional version of first-passage percolation
- Critical behavior for maximal flows on the cubic lattice
- Optimal flow through the disordered lattice
- Edge flows in the complete random-lengths network
Cited In (7)
- Edge flows in the complete random-lengths network
- Weak disorder in the stochastic mean-field model of distance. II
- Title not available (Why is that?)
- Return to the Poissonian city
- Optimal multicommodity flow through the complete graph with random edge capacities
- Uniform multicommodity flows in the hypercube with random edge‐capacities
- Title not available (Why is that?)
This page was built for publication: Uniform multicommodity flow through the complete graph with random edge-capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038093)
