Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

FOCS

2007

IEEE

2007

IEEE

We describe a deterministic, polynomial time algorithm for ﬁnding edge-disjoint paths connecting given pairs of vertices in an expander. Speciﬁcally, the input of the algorithm is a suﬃciently strong d-regular expander G on n vertices, and a sequence of pairs si, ti, (1 ≤ i ≤ r) of vertices, where r = Θ(nd log d log n ), and no vertex appears more than d/3 times in the list of all endpoints s1, t1, . . . , sr, tr. The algorithm outputs edge-disjoint paths Q1, . . . , Qr, where Qi connects si and ti. The paths are constructed online, that is, the algorithm produces Qi as soon as it gets si, ti and before the next requests in the sequence are revealed. This improves in several respects a long list of previous algorithms for the above problem, whose study is motivated by the investigation of communication networks. An analogous result is established for vertex disjoint paths in blow-ups of strong expanders.

Added |
02 Jun 2010 |

Updated |
02 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
FOCS |

Authors |
Noga Alon, Michael R. Capalbo |

Comments (0)