Optimum alphabetic binary trees

DOI10.1007/3-540-61576-8_86MaRDI QIDQ6567684zbMATH OpenFDO

Authors T.-C. Hu, John David Morgenthaler

Publication date 5 July 2024

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Algorithms – ESA 2005
• Testing the optimality of alphabetic trees
• scientific article; zbMATH DE number 437543
• Correctness of constructing optimal alphabetic trees revisited
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

Cites work

• scientific article; zbMATH DE number 437543 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3797174 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A New Algorithm for Minimum Cost Binary Trees
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Binary Trees Optimum Under Various Criteria
• Height Restricted Optimal Binary Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Optimum binary search trees
• Testing the optimality of alphabetic trees
• The Optimal Alphabetic Tree problem revisited

This page was built for publication: Optimum alphabetic binary trees

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