Testing the optimality of alphabetic trees

DOI10.1016/0304-3975(92)90334-CzbMath0745.68061MaRDI QIDQ1186607

Prakash V. Ramanan

Publication date: 28 June 1992

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

zbMATH Keywords

treesworst-case time complexity

Mathematics Subject Classification ID

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

Related Items (2)

Correctness of constructing optimal alphabetic trees revisited ⋮ Optimal binary search trees

Cites Work

• On the Polyhedral Decision Problem
• A New Algorithm for Minimum Cost Binary Trees
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Path Length of Binary Search Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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