462 search results - page 22 / 93 » Covering a Tree by a Forest |
166
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...
184
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
238
click to vote
BMCBI
2007
15 years 6 months ago
2007
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and relate...
191
click to vote
DM
2002
15 years 6 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
154
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...