Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Randomization and Approximation Techniques in Computer Science (RANDOM 1998)

Part of the book series: Lecture Notes in Computer Science ((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.

Supported in part by NSF grant CCR9530974.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986) 83–96.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. 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. 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. 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. A. M. Frieze and M. Molloy, Splitting expanders.

    Google Scholar 

  9. A. M. Frieze and L. Zhao, Edge disjoint paths in random regular graphs.

    Google Scholar 

  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. T. Leighton and S. Rao, Circuit switching: amulticommodity flowbased approach, Proceedings of a Workshop on Randomized Parallel Computing 1996.

    Google Scholar 

  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. T. Leighton, S. Rao and A. Srinivasan, New algorithmic aspects of the local lemma with applications to partitioning and routing.

    Google Scholar 

  14. A. Lubotsky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) 261–277.

    Article  MathSciNet  Google Scholar 

  15. D. Peleg and E. Upfal, Constructing disjoint paths on expander graphs, Combinatorica, 9, (1989) 289–313.

    Article  MATH  MathSciNet  Google Scholar 

  16. N. Robertson and P.D. Seymour, Graph minors-XIII: The disjoint paths problem.

    Google Scholar 

  17. A. Sinclair and M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Information and Computation 82(1) (1989) 93–133.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Carnegie-Mellon University, Pittsburgh, PA, 15213, USA

    Alan M. Frieze

Authors
  1. Alan M. Frieze
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Computer Science Institute, 1947 Center Street, Suite 600, Berkeley, CA, 94704-1198, USA

    Michael Luby

  2. Computer Science Department, University of Geneva, 24, rue Général Dufour, CH-1211, Geneva 4, Switzerland

    José D. P. Rolim

  3. University of Barcelona (UPC), Jordi Girona Salgado 1-3, E-08034, Barcelona, Spain

    Maria Serna

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frieze, A.M. (1998). Disjoint Paths in Expander Graphs via Random Walks: a Short Survey. In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-49543-6_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65142-0

  • Online ISBN: 978-3-540-49543-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation