AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nodes of a given height in a set of given trees. The aim of this article is to present a theorem that reduces such an enumeration, under certain conditions of regularity, to the simplest or most well known enumeration of a particular family of trees. Several examples of its application are given
AbstractLet T be a weighted tree. The weight of a subtree T1 of T is defined as the product of weigh...
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) ...
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) ...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
We address some issues around three main topics: on the representation of set families by a tree, on...
In the count of branches, a branchpoint is defined as a point of degree at least three, and a branch...
We prove that any IN-rational sequence s = (s n ) n1 of nonnegative integers satisfying the Kraft st...
A labelled tree rooted at its least labelled vertex is Least-Child-Being-Monk if it has the property...
AbstractWe give a general formula for the number of occurrences of a pattern, or set of patterns, in...
AbstractThe average height of a binary tree with n internal nodes is shown to be asymptotic to 2√πn....
AbstractThe average height of a binary tree with n internal nodes is shown to be asymptotic to 2√πn....
We give a general formula for the number of occurrences of a pattern, or set of patterns, in the cla...
Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutio...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
The first part is devoted to enumerative combinatorics. In the third first chapters, we study the fa...
AbstractLet T be a weighted tree. The weight of a subtree T1 of T is defined as the product of weigh...
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) ...
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) ...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
We address some issues around three main topics: on the representation of set families by a tree, on...
In the count of branches, a branchpoint is defined as a point of degree at least three, and a branch...
We prove that any IN-rational sequence s = (s n ) n1 of nonnegative integers satisfying the Kraft st...
A labelled tree rooted at its least labelled vertex is Least-Child-Being-Monk if it has the property...
AbstractWe give a general formula for the number of occurrences of a pattern, or set of patterns, in...
AbstractThe average height of a binary tree with n internal nodes is shown to be asymptotic to 2√πn....
AbstractThe average height of a binary tree with n internal nodes is shown to be asymptotic to 2√πn....
We give a general formula for the number of occurrences of a pattern, or set of patterns, in the cla...
Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutio...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
The first part is devoted to enumerative combinatorics. In the third first chapters, we study the fa...
AbstractLet T be a weighted tree. The weight of a subtree T1 of T is defined as the product of weigh...
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) ...
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) ...
DOI
Add to ORKG