A note on the Horton-Strahler number for random trees

DOI10.1016/0020-0190(94)00135-9zbMath0809.05031OpenAlexW4245945537MaRDI QIDQ1338782

Paul Kruszewski, Luc P. Devroye

Publication date: 20 November 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00135-9

zbMATH Keywords

binary treeanalysis of algorithmsrandom treesHorton-Strahler number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

A note on the Horton-Strahler number for random binary search trees ⋮ Invariant Galton–Watson trees: metric properties and attraction with respect to generalized dynamical pruning ⋮ The Horton-Strahler number of conditioned Galton-Watson trees ⋮ Random self-similar trees and a hierarchical branching process ⋮ Entropy rates for Horton self-similar trees ⋮ Invariance and attraction properties of Galton-Watson trees ⋮ Random self-similar trees: a mathematical theory of Horton laws ⋮ Large Deviation Theorem for Branches of the Random Binary Tree in the Horton--Strahler Analysis ⋮ On the Horton-Strahler number for random tries

Cites Work

• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• On programming of arithmetic operations
• On Horton's Law for Random Channel Networks
• On the Order of Random Channel Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the Horton-Strahler number for random trees