Sciweavers

3 search results - page 1 / 1
» Finding Disjoint Paths in Expanders Deterministically and On...
Sort
View
FOCS
2007
IEEE
14 years 1 days ago
Finding Disjoint Paths in Expanders Deterministically and Online
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...
Noga Alon, Michael R. Capalbo
STOC
1992
ACM
122views Algorithms» more  STOC 1992»
13 years 9 months ago
Existence and Construction of Edge Disjoint Paths on Expander Graphs
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 ...
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
13 years 5 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
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...
Yossi Azar, Uriel Feige, Daniel Glasner