Results 21 to 30 of about 1,378,752 (293)
Analysis of some statistics for increasing tree families [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 This paper deals with statistics concerning distances between randomly chosen nodes in varieties of increasing trees. Increasing trees are labelled rooted trees where labels along any branch from the root go in increasing order.
Alois Panholzer, Helmut Prodinger
doaj +2 more sources
Enumeration of Binary Trees and Universal Types [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them. The number of such trees with n nodes is now known as the Catalan number.
Charles Knessl, Wojciech Szpankowski
doaj +2 more sources
The # product in combinatorial Hopf algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We show that the # product of binary trees introduced by Aval and Viennot (2008) is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras.
Jean-Christophe Aval +2 more
doaj +1 more source
AGAT: Building and evaluating binary partition trees for image segmentation
SoftwareX, 2021 AGAT is a Java library dedicated to the construction, handling and evaluation of binary partition trees, a hierarchical data structure providing multiscale partitioning of images and, more generally, of valued graphs. On the one hand, this library offers
Jimmy Francky Randrianasoa +3 more
doaj +1 more source
On trees, tanglegrams, and tangled chains [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Tanglegrams are a class of graphs arising in computer science and in biological research on cospeciation and coevolution. They are formed by identifying the leaves of two rooted binary trees. The embedding of the trees in the plane is irrelevant for this
Sara Billey +2 more
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2011 In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux.
Jean-Christophe Aval +2 more
doaj +1 more source
Binary Trees for Dependence Structure
IEEE Access, 2020 In a data set with many categorical variables and several continuous valuables, the relationship between continuous random variables may differ from category to category for a given categorical variable.
Qingsong Shan, Qianning Liu
doaj +1 more source
New Hopf Structures on Binary Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is
Stefan Forcey +2 more
doaj +1 more source
Left and right length of paths in binary trees or on a question of Knuth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We consider extended binary trees and study the common right and left depth of leaf $j$, where the leaves are labelled from left to right by $0, 1, \ldots, n$, and the common right and left external pathlength of binary trees of size $n$.
Alois Panholzer
doaj +1 more source