1395 search results - page 261 / 279 » (k, )-Distance-Hereditary Graphs |
ALGORITHMICA
2006
13 years 8 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
CVIU
2006
13 years 8 months ago
2006
This paper presents a framework to simultaneously segment and track multiple body parts of interacting humans in the presence of mutual occlusion and shadow. The framework uses mu...
IJRR
2008
13 years 8 months ago
2008
This paper studies the quasi-static motion of large legged robots that have many degrees of freedom. While gaited walking may suffice on easy ground, rough and steep terrain requi...
MP
2006
13 years 8 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...