3 search results - page 1 / 1 » Finding Disjoint Paths in Expanders Deterministically and On... |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
STOC
1992
ACM
13 years 8 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
ALGORITHMICA
2010
13 years 5 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...