The following pages link to (Q3140420):
Displaying 10 items.
- Correctness of constructing optimal alphabetic trees revisited (Q1390875) (← 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)
- (Q3332263) (← links)
- Tight Upper and Lower Bounds on the Path Length of Binary Trees (Q4286225) (← 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)
- Optimum alphabetic binary trees (Q6567684) (← links)