Abstract
New routing algorithms and structural results for bounded-degree expander graphs have been developed. The results are unified by the fact that they are all based on, and extend, a body of work asserting that expanders are rich in short, disjoint paths. The results have consequences for the disjoint paths problem, multicommodity flow, and graph minor containment.
| Original language | English |
|---|---|
| Pages (from-to) | 86-95 |
| Number of pages | 10 |
| Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 37th Annual Symposium on Foundations of Computer Science - Burlington, VT, USA Duration: 14 Oct 1996 → 16 Oct 1996 |