Upper and Lower Bounds on Constructing Alphabetic Binary Trees

DOI10.1137/S0895480193256651MaRDI QIDQ4863980zbMATH OpenOpenAlexFDO

Authors Brendan Mumey, Maria M. Klawe

Publication date 23 April 1996

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

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

zbMATH Keywords

boundsalphabetic binary trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 437543
• Correctness of constructing optimal alphabetic trees revisited
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• Algorithms – ESA 2005
• Tight Upper and Lower Bounds on the Path Length of Binary Trees
• The Optimal Alphabetic Tree Problem Revisited
• The Optimal Alphabetic Tree problem revisited
• Optimal alphabetic trees for binary search
• A new algorithm for building alphabetic minimax trees
• Alphabetic minimax trees in linear time

Cited in

(8)

• Minimax trees in linear time with applications
• Dynamic Trees with Almost-Optimal Access Cost
• Compressing probability distributions
• On the size of the smallest alphabet for Lyndon trees
• Operations research applications of dichotomous search
• scientific article; zbMATH DE number 1947386 (Why is no real title available?)
• scientific article; zbMATH DE number 3864518 (Why is no real title available?)
• Tight Upper and Lower Bounds on the Path Length of Binary Trees

This page was built for publication: Upper and Lower Bounds on Constructing Alphabetic Binary Trees

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