720 search results - page 68 / 144 » Linear k-arboricities on trees |
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
ISBRA
2009
Springer
14 years 3 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
LICS
2012
IEEE
11 years 11 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
RECOMB
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. Lateral gene transfer (LGT) is a common mechanism of nonvertical evolution where genetic material is transferred between two more or less distantly related organisms. It ...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...