Set Orderings Requiring Costliest Alphabetic Binary Trees

DOI10.1137/0602018zbMath0498.68038OpenAlexW1971527555MaRDI QIDQ3964022

Daniel J. Kleitman, Michael E. Saks

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

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

zbMATH Keywords

sawtooth orderupper bound on the cost of alphabetic binary trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Operations research applications of dichotomous search ⋮ An extended result of Kleitman and Saks concerning binary trees

Cites Work

• A New Algorithm for Minimum Cost Binary Trees
• Binary Trees Optimum Under Various Criteria
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• A New Proof of the T-C Algorithm

This page was built for publication: Set Orderings Requiring Costliest Alphabetic Binary Trees