A Greedy Algorithm Estimating the Height of Random Trees

DOI10.1137/S0895480193258960MaRDI QIDQ4388997zbMATH OpenOpenAlexFDO

Authors Tomasz Łuczak

Publication date 11 May 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480193258960

zbMATH Keywords

greedy algorithmsrandom trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The height of random binary unlabelled trees
• On weighted heights of random trees
• Weighted height of random trees
• On the height of random m‐ary search trees
• Profile and height of random binary search trees
• On the Variance of the Height of Random Binary Search Trees

Cited in

(2)

• An algorithm for the Lorenz measure in locational decisions on trees
• Surprising identities for the greedy independent set on Cayley trees

This page was built for publication: A Greedy Algorithm Estimating the Height of Random Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388997)