Uniform multicommodity flows in the hypercube with random edge‐capacities
From MaRDI portal
Publication:5739099
DOI10.1002/rsa.20672zbMath1364.05033arXiv1406.4433OpenAlexW2962847876MaRDI QIDQ5739099
Paul Withers, Alexander D. Scott, Colin J. H. McDiarmid
Publication date: 2 June 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.4433
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Flows in graphs (05C21)
Related Items (1)
Cites Work
- Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
- Uniform multicommodity flow through the complete graph with random edge-capacities
- Largest random component of a k-cube
- Evolution of the \(n\)-cube
- Fast approximation algorithms for multicommodity flow problems
- Optimal flow through the disordered lattice
- Edge flows in the complete random-lengths network
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Complete matchings in random subgraphs of the cube
- The Evolution of Random Subgraphs of the Cube
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- On the diameter and radius of randon subgraphs of the cube
- Connectivity properties of random subgraphs of the cube
This page was built for publication: Uniform multicommodity flows in the hypercube with random edge‐capacities
