4137 search results - page 105 / 828 » On the number of matchings of a tree |
187
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...
139
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
148
click to vote
EJC
2006
15 years 6 months ago
2006
Abstract. A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees wi...
185
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny infe...
194
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...