680 search results - page 1 / 136 » A randomized embedding algorithm for trees |
COMBINATORICA
2010
13 years 1 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
IPPS
1998
IEEE
13 years 8 months ago
1998
IEEE
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
RECOMB
2006
Springer
14 years 4 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
ESA
1995
Springer
13 years 8 months ago
1995
Springer
We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra se...