Set Orderings Requiring Costliest Alphabetic Binary Trees

DOI10.1137/0602018MaRDI QIDQ3964022zbMATH OpenOpenAlexFDO

Authors Daniel J. Kleitman, Michael 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

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

Cites work

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

Cited in

(2)

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

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

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