2354 search results - page 61 / 471 » Radio number for trees |
CORR
2010
Springer
14 years 4 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...
BMCBI
2006
14 years 9 months ago
2006
Background: In the genomic age, gene trees may contain large amounts of data making them hard to read and understand. Therefore, an automated simplification is important. Results:...
JCB
2006
14 years 9 months ago
2006
For a model of molecular evolution to be useful for phylogenetic inference, the topology of evolutionary trees must be identifiable. That is, from a joint distribution the model p...
IJFCS
2007
14 years 9 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
100
click to vote
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...