Upper and Lower Bounds on Constructing Alphabetic Binary Trees
DOI10.1137/S0895480193256651zbMATH Open0837.05047OpenAlexW2090918100MaRDI QIDQ4863980FDOQ4863980
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
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
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)
Cited In (8)
- On the size of the smallest alphabet for Lyndon trees
- Title not available (Why is that?)
- Dynamic Trees with Almost-Optimal Access Cost
- Compressing probability distributions
- Minimax trees in linear time with applications
- Operations research applications of dichotomous search
- Tight Upper and Lower Bounds on the Path Length of Binary Trees
- Title not available (Why is that?)
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)
