The Optimal Alphabetic Tree problem revisited

DOI10.1007/3-540-58201-0_73MaRDI QIDQ4632431zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore, Teresa Przytycka

Publication date 29 April 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58201-0_73

zbMATH Keywords

binary treeinput sequenceinternal nodelinear-time algorithm

Mathematics Subject Classification ID

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

Recommendations

• The Optimal Alphabetic Tree Problem Revisited
• Testing the optimality of alphabetic trees
• Algorithms – ESA 2005
• Correctness of constructing optimal alphabetic trees revisited
• Optimal alphabetic trees for binary search
• Optimal alphabetic binary tree for a nonregular cost function
• Alphabetic minimax trees in linear time
• A new algorithm for building alphabetic minimax trees
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

Cites work

• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• A linear-time algorithm for a special case of disjoint set union
• A New Algorithm for Minimum Cost Binary Trees
• A New Proof of the T-C Algorithm
• A parallel algorithm for optimum height-limited alphabetic binary trees
• A simple parallel tree contraction algorithm
• scientific article; zbMATH DE number 432778 (Why is no real title available?)
• scientific article; zbMATH DE number 437543 (Why is no real title available?)
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

Cited in

(11)

• Testing the optimality of alphabetic trees
• A parallel algorithm for optimum height-limited alphabetic binary trees
• On the Huffman and alphabetic tree problem with general cost functions
• On the size of the smallest alphabet for Lyndon trees
• scientific article; zbMATH DE number 437543 (Why is no real title available?)
• The Optimal Alphabetic Tree Problem Revisited
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• scientific article; zbMATH DE number 1947386 (Why is no real title available?)
• Upper and Lower Bounds on Constructing Alphabetic Binary Trees
• Algorithms – ESA 2005
• Optimum alphabetic binary trees

This page was built for publication: The Optimal Alphabetic Tree problem revisited

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