Short paths in expander graphs
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networksIEEE Transactions on Computers, 1992
- An O (log N ) deterministic packet-routing schemeJournal of the ACM, 1992
- A separator theorem for nonplanar graphsJournal of the American Mathematical Society, 1990
- Graph minors. VIII. A kuratowski theorem for general surfacesJournal of Combinatorial Theory, Series B, 1990
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- Complexity of network synchronizationJournal of the ACM, 1985
- On size Ramsey number of paths, trees, and circuits. IJournal of Graph Theory, 1983
- Polynomial algorithms in linear programmingUSSR Computational Mathematics and Mathematical Physics, 1980
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976