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

Authors:
Alan M. Frieze
Affiliations:
-
Venue:
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Year:
1998

Citing 9
Cited 0

Eigen values and expanders

Combinatorica
Approximate counting, uniform generation and rapidly mixing Markov chains

Information and Computation
Existence and construction of edge disjoint paths on expander graphs

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Existence and Construction of Edge-Disjoint Pathson Expander Graphs

SIAM Journal on Computing
An efficient algorithm for the vertex-disjoint paths problem in random graphs

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Paths, Flows, and VLSI-Layout

Paths, Flows, and VLSI-Layout
Multicommodity Flow and Circuit Switching

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
Short paths in expander graphs

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.