Label-based parameters in increasing trees
Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit{recursive trees}$, $\textit{plane-oriented recursiv...
Main Authors: | Markus Kuba, Alois Panholzer |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2006-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3482/pdf |
Similar Items
-
Influence of the tie-break rule on the end-vertex problem
by: Pierre Charbit, et al.
Published: (2014-07-01) -
Some exactly solvable models of urn process theory
by: Philippe Flajolet, et al.
Published: (2006-01-01) -
Analysis of the total costs for variants of the Union-Find algorithm
by: Markus Kuba, et al.
Published: (2007-01-01) -
Multivariate generalizations of the Foata-Schützenberger equidistribution
by: Florent Hivert, et al.
Published: (2006-01-01) -
Left and right length of paths in binary trees or on a question of Knuth
by: Alois Panholzer
Published: (2006-01-01)