Existence and Construction of Edge-Disjoint Paths on Expander Graphs
- 1 October 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (5) , 976-989
- https://doi.org/10.1137/s0097539792232021
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The strong chromatic number of a graphRandom Structures & Algorithms, 1992
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- The linear arboricity of graphsIsrael Journal of Mathematics, 1988
- Ramanujan graphsCombinatorica, 1988
- Eigenvalues and expandersCombinatorica, 1986
- Constructing a perfect matching is in random NCCombinatorica, 1986
- Probabilistic methods in graph theoryAnnals of Operations Research, 1984
- On the connectivity of randomm-orientable graphs and digraphsCombinatorica, 1982
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963