1545 search results - page 137 / 309 » On tree congestion of graphs |
JGT
2011
14 years 5 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
ESA
1998
Springer
15 years 2 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
101
click to vote
GBRPR
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
71
Voted
BILDMED
2008
14 years 11 months ago
2008
Abstract. Validation of non-rigid registration methods is still a challenging task. Different evaluation criteria were published, yet no widely accepted gold standard exists. The a...
WOB
2004
14 years 11 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...