Finding Disjoint Paths in Expanders Deterministically and Online

We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorithm is a sufficiently strong d-regular expander G on n vertices, and a sequence of pairs s<sub>i</sub>, t<sub>i</sub> (1lesilesr) of vertices, where, r=Theta(nd log d/log n), and no vertex appears more than d/3 times in the list of all endpoints s1, t1,... ,s<sub>r</sub>,t<sub>r</sub>. The algorithm outputs edge-disjoint paths Q<sub>1</sub>,...,Q<sub>r</sub>, where Q<sub>i</sub> connects s<sub>i</sub> and t<sub>i</sub>. The paths are constructed online, that is, the algorithm produces Q<sub>i</sub> as soon as it gets s<sub>i,</sub> t<sub>i</sub> and before the next requests in the sequence are revealed. This improves in several respects a long list of previous algorithms for the above problem, whose study is motivated by the investigation of communication networks. An analogous result is established for vertex disjoint paths in blowups of strong expanders.

[1]  Alan M. Frieze.  Edge-disjoint paths in expander graphs , 2000, SODA '00.

[2]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[3]  Noga Alon,et al.  Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling , 1994, Theor. Comput. Sci..

[4]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

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

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

[7]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[8]  Bruce M. Maggs,et al.  On-line algorithms for path selection in a nonblocking network , 1990, STOC '90.

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

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

[11]  M. Murty.  Ramanujan Graphs , 1965 .

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

[13]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[15]  Alan M. Frieze,et al.  Optimal construction of edge-disjoint paths in random regular graphs , 2000, SODA '99.

[16]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

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