Constructing disjoint paths on expander graphs
- 1 September 1989
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 9 (3) , 289-313
- https://doi.org/10.1007/bf02125897
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Matching is as easy as matrix inversionPublished by Association for Computing Machinery (ACM) ,1987
- The token distribution problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Eigenvalues and expandersCombinatorica, 1986
- Constructing a perfect matching is in random NCCombinatorica, 1986
- Parallel hashing---an efficient implementation of shared memoryPublished by Association for Computing Machinery (ACM) ,1986
- Explicit expanders and the Ramanujan conjecturesPublished by Association for Computing Machinery (ACM) ,1986
- Non-blocking networksPublished by Association for Computing Machinery (ACM) ,1986
- Parallel Communication With Limited BuffersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982
- Randomized parallel communication (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1982