Edge-disjoint paths in expander graphs

SIAM Journal on Computing

Volumn 30, Issue 6, 2000, Pages 1790-1801

  Frieze, Alan M ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Edge disjoint paths; Expander graphs; Randomized algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; INTEGRATED CIRCUIT LAYOUT; MARKOV PROCESSES; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; VLSI CIRCUITS;

EDGE DISJOINT PATHS; EXPANDER GRAPHS; RANDOMIZED ALGORITHMS;

GRAPH THEORY;

EID: 0035704466     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539700366103     Document Type: Article

References (22)

1. J. A. BONDY AND U. S. R. MURTY, Graph Theory with Applications, American Elsevier, New York, 1976.
2. A. Z. BRODER, A. M. FRIEZE, AND E. UPFAL, Existence and construction of edge-disjoint paths on expander graphs, SIAM J. Comp., 23 (1994), pp. 976-989.
3. A. Z. BRODER, A. M. FRIEZE, AND E. UPFAL, Existence and construction of edge low congestion paths on expander graphs, Random Structures Algorithms, 14 (1999), pp. 87-109.
4. I. H. DINWOODIE, A probability inequality for the occupation probability of a reversible Markov chain, Ann. Appl. Probab., 5 (1995), pp. 37-43.
5. A. FRANK, Disjoint paths in rectilinear grids, Combinatorica, 2 (1982), pp. 361-371.
6. A. M. FRIEZE, Disjoint paths in expander graphs via random walks: A short survey, in Proceedings of Random '98, Lecture Notes in Comput. Sei. 1518 (1998), Springer, Berlin, 1998, pp. 1-14.
7. A. M. FRIEZE AND M. MOLLOY, Splitting an expander graph, 3. Algorithms, 33 (1999), pp. 166-172.
8. A. M. FRIEZE AND L. ZHAO, Optimal construction of edge disjoint paths in random regular graphs, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 1999, pp. 346-355.
9. D. GALE, A theorem on flows in networks, Pacific J. Math., 7 (1957), pp. 1073-1082.
10. D. GlLLMAN, A Chernoff bound for random walks on expander graphs, SIAM J. Comput., 27 (1998), pp. 1203-1220.
11. N. KAHALE, Large Deviation Bounds for Markov Chains, DIMACS Technical Report, DI-MACS, Rutgers University, New Brunswick, NJ, 1994.
12. J. KLEINBERG AND R. RUBINFELD, Short paths in expander graphs, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 86-95.
13. J. KLEINBERG AND E. TARDOS, Approximations for the disjoint paths problem in high diameter planar networks, J. Comput. System Sei. 57 (1998), pp. 61-73.
14. T. LEIGHTON AND S. RAO, Circuit switching: A multicommodity flow based approach, in Proceedings of a Workshop on Randomized Parallel Computing, Hawaii, 1996.
15. T. LEIGHTON, S. RAO, AND A. SRINIVASAN, Multi-commodity flow and circuit switching, in Proceedings of the Hawaii International Conference on System Sciences, Hawaii, 1998.
16. T. LEIGHTON, S. RAO, AND A. SRINIVASAN, New algorithmic aspects of the local lemma with applications to routing and partitioning, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 1999, pp. 643-652.
17. A. LUBOTSKY, R. PHILLIPS, AND P. SARNAK, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-277.
18. D. PELEG AND E. UPFAL, Constructing disjoint paths on expander graphs, Combinatorica, 9 (1989), pp. 289-313.
19. N. ROBERTSON AND P. D. SEYMOUR, Graph minors-Xlll: The disjoint paths problem, J. Combin. Theory Ser. B, 63 (1995), pp. 65-110.
20. A. SINCLAIR AND M. JERRUM, Approximate counting, uniform generation, and rapidly mixing Markov chains, Inform. Comput., 82 (1989), pp. 93-133.
21. D. WAGNER AND K. WEIHE, A linear time algorithm for edge-disjoint paths in planar graphs, in Proceedings of the First European Symposium on Algorithms (ESA '93), Lecture Notes in Comput. Sei. 726, Springer-Verlag, Berlin, 1992, pp. 384-395.
22. X. ZHOU, S. TAMURA, AND T. NISHIZEKI, Finding edge-disjoint paths in partial k-trees, Algorithmica, 26 (2000), pp. 3-30.