Advertisement

Disjoint Paths in Expander Graphs via Random Walks: a Short Survey

  • Alan M. Frieze
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1518)

Abstract

There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Frieze and Upfal.

Keywords

Random Walk Random Graph Disjoint Path Expansion Property Expander Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986) 83–96.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    A. Z. Broder, A. M. Frieze and E. Upfal, Existence and construction of edge-disjoint paths on expander graphs, SIAM Journal of Computing 23 (1994) 976–989.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    A. Z. Broder, A.M. Frieze and E. Upfal, Existence and construction of edge low congestion paths on expander graphs, Proceedings of the 29th Annual ACM Symposium on Theory of Computing, (1997) 531–539.Google Scholar
  4. [4]
    A. Z. Broder, A. M. Frieze, S. Suen and E. Upfal, Optimal construction of edge disjoint paths in random graphs, Proceedings of 4th Annual Symposium on Discrete Algorithms, (1994) 603–612.Google Scholar
  5. [5]
    A. Z. Broder, A. M. Frieze, S. Suen and E. Upfal, An efficient algorithm for the vertex-disjoint paths problem in random graphs, Proceedings of 6th Annual Symposium on Discrete Algorithms, (1996) 261–268.Google Scholar
  6. [6]
    P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, In A. Hajnal et al., editors, Infinite and Finite Sets, Volume 11 of Colloq. Math. Soc. J. Bolyai (1975)609–627.Google Scholar
  7. [7]
    A. Frank, Packing paths, cuts and circuits-a survey, in Paths, Flows and VLSI Layout, B. Korte, L. Lovász, H. J. Prömel and A. Schrijver Eds., Springer-Verlag, 1990.Google Scholar
  8. [8]
    A. M. Frieze and M. Molloy, Splitting expanders.Google Scholar
  9. [9]
    A. M. Frieze and L. Zhao, Edge disjoint paths in random regular graphs.Google Scholar
  10. [10]
    J. Kleinberg and R. Rubinfeld, Short paths in expander graphs, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, (1996) 86–95.Google Scholar
  11. [11]
    T. Leighton and S. Rao, Circuit switching: amulticommodity flowbased approach, Proceedings of a Workshop on Randomized Parallel Computing 1996.Google Scholar
  12. [12]
    T. Leighton, S. Rao and A. Srinivasan, Multi-commodity flow and circuit switching, Proceedings of the Hawaii International Conference on System Sciences, 1998.Google Scholar
  13. [13]
    T. Leighton, S. Rao and A. Srinivasan, New algorithmic aspects of the local lemma with applications to partitioning and routing.Google Scholar
  14. [14]
    A. Lubotsky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) 261–277.CrossRefMathSciNetGoogle Scholar
  15. [15]
    D. Peleg and E. Upfal, Constructing disjoint paths on expander graphs, Combinatorica, 9, (1989) 289–313.zbMATHCrossRefMathSciNetGoogle Scholar
  16. [16]
    N. Robertson and P.D. Seymour, Graph minors-XIII: The disjoint paths problem.Google Scholar
  17. [17]
    A. Sinclair and M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Information and Computation 82(1) (1989) 93–133.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Alan M. Frieze
    • 1
  1. 1.Department of Mathematical SciencesCarnegie-Mellon UniversityPittsburghUSA

Personalised recommendations