Correctness of constructing optimal alphabetic trees revisited

DOI10.1016/S0304-3975(96)00296-4MaRDI QIDQ1390875zbMATH OpenFDO

Authors Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter

Publication date 22 July 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Garsia-Wachs algorithmoptimal alphabetic trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Testing the optimality of alphabetic trees
• Algorithms – ESA 2005
• A new proof of the Garsia-Wachs algorithm
• 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 3303654 (Why is no real title available?)
• 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
• A fast algorithm for optimal length-limited Huffman codes
• A new proof of the Garsia-Wachs algorithm
• 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

Cited in

(8)

• On the redundancy of D-ary Fano codes
• Optimum alphabetic binary trees
• On the Huffman and alphabetic tree problem with general cost functions
• An optimal, purely functional implementation of the Garsia-Wachs algorithm
• Upper and Lower Bounds on Constructing Alphabetic Binary Trees
• Testing the optimality of alphabetic trees
• The Optimal Alphabetic Tree problem revisited
• A New Proof of the T-C Algorithm

This page was built for publication: Correctness of constructing optimal alphabetic trees revisited

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