Pages that link to "Item:Q4632431"
From MaRDI portal
The following pages link to The Optimal Alphabetic Tree problem revisited (Q4632431):
Displaying 7 items.
- Testing the optimality of alphabetic trees (Q1186607) (← links)
- A parallel algorithm for optimum height-limited alphabetic binary trees (Q1923383) (← 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)
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees (Q4863980) (← links)
- Optimum alphabetic binary trees (Q6567684) (← links)