Optimal Construction of Edge-Disjoint Paths in Random Graphs
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (2) , 541-573
- https://doi.org/10.1137/s0097539795290805
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Existence and Construction of Edge-Disjoint Paths on Expander GraphsSIAM Journal on Computing, 1994
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random GraphsOperations Research, 1992
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- The Token Distribution ProblemSIAM Journal on Computing, 1989
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978
- A theorem on flows in networksPacific Journal of Mathematics, 1957