Upper and Lower Bounds on Constructing Alphabetic Binary Trees
From MaRDI portal
Publication:4863980
DOI10.1137/S0895480193256651zbMath0837.05047OpenAlexW2090918100MaRDI QIDQ4863980
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
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Data structures (68P05)
Related Items (4)
Operations research applications of dichotomous search ⋮ Dynamic Trees with Almost-Optimal Access Cost ⋮ Minimax trees in linear time with applications ⋮ Compressing probability distributions
This page was built for publication: Upper and Lower Bounds on Constructing Alphabetic Binary Trees