The Optimal Alphabetic Tree problem revisited

DOI10.1007/3-540-58201-0_73zbMath1422.68133OpenAlexW1486459277MaRDI QIDQ4632431

Lawrence L. Larmore, Teresa M. 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 treelinear-time algorithminput sequenceinternal node

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• A parallel algorithm for optimum height-limited alphabetic binary trees
• A New Algorithm for Minimum Cost Binary Trees
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• A simple parallel tree contraction algorithm
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• A New Proof of the T-C Algorithm

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