14 search results - page 1 / 3 » Optimal Construction Of Edge-Disjoint Paths In Random Regula... |
CPC
2000
13 years 4 months ago
2000
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 ...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
ACCV
2010
Springer
12 years 11 months ago
2010
Springer
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...