Correctness of constructing optimal alphabetic trees revisited

DOI10.1016/S0304-3975(96)00296-4zbMath0901.68144MaRDI QIDQ1390875

Marek Karpinski, Wojciech Rytter, Lawrence L. Larmore

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)

Related Items (3)

On the redundancy of \(D\)-ary Fano codes ⋮ An optimal, purely functional implementation of the Garsia–Wachs algorithm ⋮ On the Huffman and alphabetic tree problem with general cost functions

Cites Work

• Unnamed Item
• Unnamed Item
• Testing the optimality of alphabetic trees
• Optimum binary search trees
• A fast algorithm for optimal length-limited Huffman codes
• A new proof of the Garsia-Wachs algorithm
• A New Algorithm for Minimum Cost Binary Trees
• The Optimal Alphabetic Tree Problem Revisited
• 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: Correctness of constructing optimal alphabetic trees revisited