Existence and construction of edge disjoint paths on expander graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 140-149

  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

COMPUTATION THEORY; ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; GRAPH THEORY; RANDOM PROCESSES;

BOUNDED DEGREE; CONSTRUCTION ALGORITHMS; DECISION PROBLEMS; EDGE DISJOINT PATHS; EXPANDER GRAPHS; EXPANSION PROPERTIES; GENERAL GRAPH; TIME ALGORITHMS;

GRAPH THEORY; COMPUTATIONAL METHODS;

EDGE DISJOINT PATHS; EXPANDER GRAPHS;

EID: 0026981385     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129727     Document Type: Conference Paper

References (19)

1. N. Alon. The linear arboricity of graphs. Israel J. Math., 62:311-325, 1988.
2. N. Alon. A parallel algorithmic version of the Local Lemma. Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1991.
3. N. Alon. The strong chromatic number of of a graph. Random Struct. Alg., 3:1-8, 1992.
4. N. Alon and F.R.K. Chung. Explicit construction of linear sized tolerant networks. Discrete Mathematics, 72:15-19,1989.
5. J. Beck. An Algorithmic Approach to the Lovász Local Lemma I. Random Struct. Alg., 2:343-365, 1991.
6. V. Chvátal Probabilistic methods in graph theory In Stochastics and Optimization (F.Archetti and F.Maffioli Eds.), Annals of Operations Research, 1:171-182, 1984.
7. P. Erdös and L. Lovász. Problems and Results on 3-Chromatic Hypergraphs and Some Related Questions. In Infinite and Finite Sets, (A. Hajnal et. al. eds), Colloq. Math. Soc. J. Bolyai 11, North Holland, 1975, pp. 609-627.
8. T.I. Fenner and A.M. Frieze. On the connectivity of random m-orientable graphs and digraphs. Combinatorica, 2:347-359,1982.
9. A. Frank and A. Gyarfas. How to orient the edges of a graph? Colloq. Math. Soc. J. Bolyai, 18:353-364, 1978.
10. J. Friedman, J. Kahn, and E. Szemerédi. On the second eigenvalue in random regular graphs. In Proceedings of the 21sth Annual ACM Symposium on Theory of Computing, pages 587-598, 1989.
11. W. Hoeffding. Probability Inequalities for Sums of Bounded Random variables. In Journal of the American Statistical Association, 58:13-30,1963.
12. T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 264-274. IEEE, 1990.
13. A. Lubotsky, R. Phillips, and P. Sarnak. Ramanujan graphs, Combinatorica, 8:261-277, 1988.
14. A.Sinclair and M.Jerrum Approximate Counting, Uniform Generation, and Rapidly Mixing Markov Chains. Information and Computation, 82:93-133, 1989.
15. J. Spencer. Ten Lectures on the Probabilistic Method. SIAM, 1987.
16. D. Peleg and E. Upfal. Construction Disjoint Paths on Expander Graphs. Combinatorica, 9:289-313,1989.
17. D. Peleg and E. Upfal. The token distribution problem. SIAM Journal of Computing, 18:229-243,1989.
18. N.Robertson and P.D.Seymour Graph minors-XIII: The disjoint paths problem, to appear
19. E. Upfal. An O(logiV) deterministic packet routing scheme. In Proceedings of 21st Annual ACM Symposium on Theory of Computing, 241-250, 1989.