Uniform multicommodity flow through the complete graph with random edge-capacities
From MaRDI portal
Recommendations
Cites work
- Bulk transport properties and exponent inequalities for random resistor and flow networks
- Cost-volume relationship for flows through a disordered network
- Critical behavior for maximal flows on the cubic lattice
- Dynamic Routing in Fully Connected Networks
- Edge flows in the complete random-lengths network
- First-passage percolation, network flows and electrical resistances
- Integer and fractional packings in dense graphs
- Near perfect coverings in graphs and hypergraphs
- Network flows. Theory, algorithms, and applications.
- Optimal flow through the disordered lattice
- Surfaces with minimal random weights and maximal flows: a higher dimensional version of first-passage percolation
Cited in
(7)- Edge flows in the complete random-lengths network
- Weak disorder in the stochastic mean-field model of distance. II
- scientific article; zbMATH DE number 3902366 (Why is no real title available?)
- Return to the Poissonian city
- Optimal multicommodity flow through the complete graph with random edge capacities
- scientific article; zbMATH DE number 3968280 (Why is no real title available?)
- Uniform multicommodity flows in the hypercube with random edge‐capacities
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)