Pages that link to "Item:Q4216143"
From MaRDI portal
The following pages link to The Optimal Alphabetic Tree Problem Revisited (Q4216143):
Displaying 9 items.
- Optimal alphabetic trees for binary search (Q293336) (← links)
- Correctness of constructing optimal alphabetic trees revisited (Q1390875) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- (Q4411351) (← links)
- The Optimal Alphabetic Tree problem revisited (Q4632431) (← links)
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees (Q4863980) (← links)
- Optimal binary search trees (Q5906917) (← links)