Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach
- 1 January 1999
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 14 (1), 87-109
- https://doi.org/10.1002/(sici)1098-2418(1999010)14:1<87::aid-rsa5>3.0.co;2-o
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On-line admission control and circuit routing for high performance computing and communicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Existence and Construction of Edge-Disjoint Paths on Expander GraphsSIAM Journal on Computing, 1994
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- Ramanujan graphsCombinatorica, 1988
- Eigenvalues and expandersCombinatorica, 1986