Existence and construction of edge disjoint paths on expander graphs

Authors:
Andrei Z. Broder;Alan M. Frieze;Eli Upfal
Affiliations:
DEC-SRC, 130 Lytton Ave, Palo Alto, CA;Department of Mathematics, Carnegie-Mellon University;IBM Almaden Research Center, San Jose, CA and Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Explicit construction of linear sized tolerant networks

Discrete Mathematics - First Japan Conference on Graph Theory and Applications
The token distribution problem

SIAM Journal on Computing
Approximate counting, uniform generation and rapidly mixing Markov chains

Information and Computation
An O(logN) deterministic packet routing scheme

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the second eigenvalue of random regular graphs

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A parallel algorithmic version of the Local Lemma

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science

Routing permutations on graphs via matchings

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximations for the disjoint paths problem in high-diameter planar networks

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Universal algorithms for store-and-forward and wormhole routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An efficient algorithm for the vertex-disjoint paths problem in random graphs

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The lovász-local-lemma and scheduling

Efficient Approximation and Online Algorithms

Hi-index	0.00