Testing the optimality of alphabetic trees

DOI10.1016/0304-3975(92)90334-CMaRDI QIDQ1186607zbMATH OpenFDO

Authors Prakash V. Ramanan

Publication date 28 June 1992

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

Full work available at URL https://doi.org/10.1016/0304-3975(92)90334-C

zbMATH Keywords

treesworst-case time complexity

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithms – ESA 2005
• Correctness of constructing optimal alphabetic trees revisited
• scientific article; zbMATH DE number 437543
• Partial alphabetic trees
• The Optimal Alphabetic Tree problem revisited

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A New Algorithm for Minimum Cost Binary Trees
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3797174 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• On the Polyhedral Decision Problem
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Path Length of Binary Search Trees

Cited in

(11)

• Correctness of constructing optimal alphabetic trees revisited
• Optimal alphabetic trees for binary search
• scientific article; zbMATH DE number 437543 (Why is no real title available?)
• The Optimal Alphabetic Tree Problem Revisited
• scientific article; zbMATH DE number 1947386 (Why is no real title available?)
• The Optimal Alphabetic Tree problem revisited
• Partial alphabetic trees
• Algorithms – ESA 2005
• Optimal binary search trees
• Optimum alphabetic binary trees
• Old and new results on alphabetic codes

This page was built for publication: Testing the optimality of alphabetic trees

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