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

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.

• Type: Conference
• Year: 1998
• Where: RANDOM
• Authors: Alan M. Frieze
• Keywords: Edge Disjoint Path, Expander Graphs, RANDOM 1998, Random Walk Approach, Theoretical Computer Science