Optimal construction of edge-disjoint paths in random regular graphs

Given a graph G = (V, E) and a set of κ pairs of vertices in V, we are interested in finding, for each pair (ai, bi), a path connecting ai to bi 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 edge-disjoint paths in the random regular graph Gn,r, for sufficiently large r. (The graph is chosen first, then an adversary chooses the pairs of end-points.) We show that almost every Gn,r is such that all sets of κ = Ω(n/log n) pairs of vertices can be joined. This is within a constant factor of the optimum.

[1]  Eli Upfal,et al.  A fast parallel construction of disjoint paths in networks , 1985 .

[2]  Alan M. Frieze,et al.  Existence and construction of edge disjoint paths on expander graphs , 1992, STOC '92.

[3]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[4]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[5]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[6]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[7]  Aravind Srinivasan,et al.  Multicommodity flow and circuit switching , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[8]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[9]  Alan M. Frieze,et al.  Optimal construction of edge-disjoint paths in random graphs , 1994, SODA '94.

[10]  Dorit S. Hochbaum.  An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs , 1992, Oper. Res..

[11]  Eli Upfal,et al.  Constructing disjoint paths on expander graphs , 1987, Comb..

[12]  Éva Tardos,et al.  Approximations for the disjoint paths problem in high-diameter planar networks , 1995, STOC '95.

[13]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[14]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[15]  Alan M. Frieze,et al.  An efficient algorithm for the vertex-disjoint paths problem in random graphs , 1996, SODA '96.

[16]  P. Nguyen,et al.  On the Disjoint Paths , 1998 .

[17]  Frank Thomson Leighton,et al.  Circuit Switching: A Multicommodity Flow Based Approach , 1995 .

[18]  D. Gale.  A theorem on flows in networks , 1957 .

[19]  Alan M. Frieze.  Disjoint Paths in Expander Graphs via Random Walks: A Short Survey , 1998, RANDOM.

[20]  Endre Szemerédi,et al.  On the second eigenvalue of random regular graphs , 1989, STOC '89.

[21]  Béla Bollobás,et al.  Random Graphs , 1985 .

[22]  Aravind Srinivasan,et al.  New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.

[23]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[24]  Alan M. Frieze,et al.  Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach , 1999, Random Struct. Algorithms.

[25]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[26]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[27]  Alan M. Frieze,et al.  Existence and Construction of Edge-Disjoint Paths on Expander Graphs , 1994, SIAM J. Comput..