Static and dynamic path selection on expander graphs: a random walk approach

Authors:
Andrei Z. Broder;Alan M. Frieze;Eli Upfal
Affiliations:
-;-;-
Venue:
Random Structures & Algorithms
Year:
1999

Citing 0
Cited 3

Edge-disjoint paths in expander graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Simple on-line algorithms for the maximum disjoint paths problem

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Randomness conductors and constant-degree lossless expanders

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract