Optimum alphabetic binary trees

DOI10.1007/3-540-61576-8_86zbMATH Open1543.68288MaRDI QIDQ6567684FDOQ6567684

Authors: T.-C. Hu, John David Morgenthaler 

Publication date: 5 July 2024

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

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)

Cites Work

• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• Testing the optimality of alphabetic trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Optimum binary search trees
• A New Algorithm for Minimum Cost Binary Trees
• Title not available (Why is that?)
• Binary Trees Optimum Under Various Criteria
• Height Restricted Optimal Binary Trees
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Title not available (Why is that?)
• 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)