Given a graph G = (V; E) with n vertices, and m edges, and a family of pairs of vertices in V, we are interested in finding for each pair (a i; b i), a path connecting a i to b i, such that the set of paths so found is edge-disjoint. (For arbitrary graphs the problem is NP-complete, although it is in P if is fixed.) We present a polynomial time randomized algorithm for finding the optimal number of edge disjoint paths (up to constant factors) in the random graph Gn;m, for all edge densities above the connectivity threshold. (The graph is chosen first, then an adversary chooses the pairs of endpoints.) Our results give the first tight bounds for the edge disjoint paths problem for any non-trivial class of graphs. 1
|
1290
|
The Probabilistic Method
– Alon, Spencer, et al.
- 1992
|
|
1154
|
Random graphs
– Bollobás
- 1985
|
|
889
|
Graph Theory with Applications
– Bondy, Murty
- 1976
|
|
223
|
On the method of bounded differences
– McDiarmid
- 1989
|
|
182
|
Universal schemes for parallel communication
– Valient, Brebner
- 1981
|
|
171
|
Approximate counting, uniform generation and rapidly mixing markov chains
– Sinclair, Jerrum
|
|
132
|
Problems and results on 3-chromatic hypergraphs and some related questions
– Erdos, Lov'asz
- 1975
|
|
99
|
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
– Bollobás
- 1980
|
|
91
|
The asymptotic number of labeled graphs with given degree sequences
– Bender, Canfield
- 1978
|
|
72
|
The token distribution problem
– PELEG, UPFAL
- 1989
|
|
61
|
A theorem on flows in networks
– Gale
- 1957
|
|
61
|
On the Method of Bounded Di erences
– McDiarmid
- 1989
|
|
51
|
On the second eigenvalue in random regular graphs. STOC
– Friedman, Kahn, et al.
- 1989
|
|
39
|
Approximations for the disjoint paths problem in high-diameter planar networks. JCSS
– Kleinberg, Tardos
- 1998
|
|
26
|
Srinivasan.New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning
– Leighton, Liu, et al.
- 2001
|
|
21
|
Constructing disjoint paths on expander graphs
– Peleg, Upfal
- 1987
|
|
20
|
isoperimetric inequalities and random graphs
– Bollobás, Martingales
- 1987
|
|
20
|
Graph Theory with Applications (North-Holland
– Bondy, Murty
- 1976
|
|
19
|
Existence and construction of edge-disjoint paths on expander graphs
– Broder, Frieze, et al.
- 1994
|
|
18
|
Multicommodity flow and circuit switching
– Leighton, Rao, et al.
- 1998
|
|
16
|
Static and dynamic path selection on expander graphs: a random walk approach
– Broder, Frieze, et al.
- 1997
|
|
14
|
Disjoint Paths in Expander Graphs via Random Walks: a Short Survey
– Frieze
- 1998
|
|
13
|
Universal schemes for parallel computation
– Valiant, Brebner
- 1981
|
|
11
|
Graph minors-XIII: The disjoint paths problem
– Robertson, Seymour
- 1995
|
|
10
|
Existence and construction of edge disjoint paths on expander graphs
– Broder, Frieze, et al.
- 1994
|
|
6
|
cycles in random graphs with minimal degree at least k, in A tribute to Paul Erd}os, edited by
– Bollob'as, Fenner, et al.
- 1990
|
|
6
|
An exact sublinear algorithm for the max flow, vertex-disjoint paths, and communication problems on random graphs
– Hochbaum
- 1992
|
|
3
|
A fast construction of disjoint paths in networks
– Shamir, Upfal
- 1985
|
|
3
|
An e#cient algorithm for the vertex-disjoint paths problem in random graphs
– Broder, Frieze, et al.
- 1996
|
|
2
|
Optimal construction of vertexdisjoint paths in random graphs, in preparation
– Broder, Frieze, et al.
- 1996
|
|
2
|
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
– as
- 1980
|
|
2
|
Martingales, isoperimetric inequalities and random graphs
– as, B
- 1988
|
|
1
|
Erd os and L. Lov asz, Problems and results on 3-chromatic hypergraphs and some related questions
– unknown authors
- 1975
|
