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

Random Structures and Algorithms

Volumn 14, Issue 1, 1999, Pages 87-109

  Broder, Andrei Z ^a   Frieze, Alan M ^b   Upfal, Eli ^c,d  

^a HEWLETT PACKARD COMPANY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033483124     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(1999010)14:1<87::AID-RSA5>3.0.CO;2-O     Document Type: Article

References (16)

1. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986), 83-96.
2. N. Alon and F.R.K. Chung, Explicit construction of linear sized tolerant networks, Discrete Math 72 (1989), 15-19.
3. N. Alon and J. Spencer, The probabilistic method, John Wiley and Sons, 1992.
4. B. Awerbuch, Y. Azar, and S. Plotkin, Throughput-Competitive On-Line Routing, in 34th Annual Symposium on Foundations of Computer Science, IEEE, Palo Alto, CA, Nov. 3-5, 1993, pp. 32-40.
5. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani, On-Line Admission Control and Circuit Routing for High Performance Computing and Communication, 35th Annual Symposium on Foundations of Computer Science, IEEE, Santa Fe, NM, Nov. 20-22, 1994, pp. 412-423.
6. A.Z. Broder, A.M. Frieze, and E. Upfal, Existence and construction of edge-disjoint paths on expander graphs, SIAM J Comput 23(5) (Oct. 1994), 976-989.
7. P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, Colloq Math Soc János Bolyai 11 (1975), 609-627.
8. J. Friedman, J. Kahn, and E. Szemerédi, On the Second Eigenvalue in Random Regular Graphs, Proc of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 587-598.
9. A. Kamath, O. Palmon, and S. Plotkin, Routing and Admission Control in General Topology Networks with Poisson Arrivals, Proc of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, Jan. 28-30, 1996, pp. 269-278.
10. J. Kleinberg and R. Rubinfeld, Short Paths in Expander Graphs, 37th Annual Symposium on Foundations of Computer Science, IEEE, Burlington, VT, Oct. 14-16, 1996.
11. A. Lubotsky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988), 261-277.
12. F.P. Kelley, Blocking probabilities in large circuit-switching networks, Adv Appl Prob 18 (1986), 573-505.
13. F.T. Leighton and S. Rao, Circuit Switching: A Multi-Commodity Flow Based Approach, Proc. of 9th International Parallel Processing Symposium, 1995.
14. A. Lubotsky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988), 261-277.
15. N. Robertson and P.D. Seymour, Graph minors-XIII: The disjoint paths problem. J Combin Theory Ser B 63 (1995), 65-110.
16. A. Sinclair and M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Inf Comp 82(1) (1989), 93-133.