The height of multiple edge plane trees
DOI10.1007/S00010-015-0380-0zbMATH Open1337.05055arXiv1503.04749OpenAlexW1942124093WikidataQ59463244 ScholiaQ59463244MaRDI QIDQ291297FDOQ291297
Authors: Clemens Heuberger, Helmut Prodinger, Stephan Wagner
Publication date: 7 June 2016
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.04749
Recommendations
Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)
Cites Work
- Analytic combinatorics
- On convergence rates in the central limit theorems for combinatorial structures
- Singularity Analysis of Generating Functions
- Random Trees
- Mellin transforms and asymptotics: Harmonic sums
- The average height of binary trees and other simple trees
- Title not available (Why is that?)
- The Distribution of Heights of Binary Trees and Other Simple Trees
- Mathematics for the Analysis of Algorithms.
- The average height of planted plane trees with M leaves
- The average height of r-tuply rooted planted plane trees
- A note on a result of R. Kemp on r-tuply rooted planted plane trees
- Title not available (Why is that?)
- Register Allocation for Unary–Binary Trees
- Enumerations of plane trees with multiple edges and Raney lattice paths
- Title not available (Why is that?)
- A lattice of combinatorial Hopf algebras, Application to binary trees with multiplicities
Cited In (4)
Uses Software
This page was built for publication: The height of multiple edge plane trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291297)