Pages that link to "Item:Q4327425"
From MaRDI portal
The following pages link to A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees (Q4327425):
Displaying 7 items.
- Optimal alphabetic trees for binary search (Q293336) (← links)
- Binary search trees of almost optimal height (Q911247) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Analytical aspects of tie breaking (Q1929235) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- The Optimal Alphabetic Tree problem revisited (Q4632431) (← links)
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees (Q4863980) (← links)