Arc-disjoint paths in expander digraphs

SIAM Journal on Computing

Volumn 32, Issue 2, 2003, Pages 326-344

  Bohman, Tom ^a   Frieze, Alan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Edge disjoint paths; Expander digraphs; Randomized algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

ARC DISJOINT PATHS; EXPANDER DIGRAPHS; RANDOMIZED ALGORITHM;

GRAPH THEORY;

EID: 0038285479     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701398582     Document Type: Article

References (25)

1. N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley, New York, 1992.
2. J. Bang-jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, Springer-Verlag, London, 2001.
3. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, Amsterdam, 1976.
4. A. Z. Broder, A. M. Frieze, and E. Upfal, Existence and construction of edge-disjoint paths on expander graphs, SIAM J. Comput., 23 (1994), pp. 976-989.
5. 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.
6. S. Fortune, J. E. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoret. Comput. Sci., 10 (1980), pp. 111-121.
7. A. Frank, Disjoint paths in rectilinear grids, Combinatorica, 2 (1982), pp. 361-371.
8. A. M. Frieze, Disjoint Paths in Expander Graphs via Random Walks: A Short Survey, in Proceedings of Random '98, Lecture Notes in Comput. Sci. 1518, Springer-Verlag, New York, 1998, pp. 1-14.
9. A. M. Frieze, Edge-disjoint paths in expander graphs, SIAM J. Comput., 30 (2001), pp. 1790-1801.
10. A. M. Frieze and M. Molloy, Splitting an expander graph, J. Algorithms, 33 (1999), pp. 166-172.
11. A. M. Frieze and L. Zhao, Optimal construction of edge-disjoint paths in random regular graphs, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 1999, pp. 346-355.
12. D. Gale, A theorem on flows in networks, Pacific J. Math., 7 (1957), pp. 1073-1082.
13. J. Kleinberg and R. Rubinfeld, Short paths in expander graphs, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1996, pp. 86-95.
14. J. Kleinberg and E. Tardos, Approximations for the disjoint paths problem in high diameter planar networks, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1995, pp. 26-35.
15. D. E. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Addison-Wesley, Reading, MA, 1968.
16. T. Leighton and S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46 (1999), pp. 787-832.
17. T. Leighton and S Rao, Circuit switching: A multicommodity flow based approach, in Proceedings of a Workshop on Randomized Parallel Computing, 1996.
18. T. Leighton, S. Rao, and A. Srinivasan, Multi-commodity flow and circuit switching, in Proceedings of the Hawaii International Conference on System Sciences, 1998.
19. T. Leighton, S. Rao, and A. Srinivasan, New algorithmic aspects of the local lemma with applications to routing and partitioning, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 1999, pp. 643-652.
20. A. Lubotsky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-277.
21. D. Peleg and E. Upfal, Constructing disjoint paths on expander graphs, Combinatorica, 9 (1989), pp. 289-313.
22. N. Robertson and P. D. Seymour, Graph minors. XIII: The disjoint paths problem, J. Combin. Theory Ser. B, 63 (1995), pp. 65-110.
23. A. Sinclair and M. Jerrum, Approximate counting, uniform generation, and rapidly mixing Markov chains, Inform. and Comput., 82 (1989), pp. 93-133.
24. D. Wagner and K. Weihe, A linear time algorithm for edge-disjoint paths in planar graphs, Proceedings of the First European Symposium on Algorithms (ESA '93), in Lecture Notes in Comput. Sci. 726, Springer-Verlag, New York, 1992, pp. 384-395.
25. X. Zhou, S. Tamura, and T. Nishizeki, Finding edge-disjoint paths in partial k-trees, Algorithmica, 26 (2000), pp. 3-30.