A new proof of the Garsia-Wachs algorithm
Journal of Algorithms
Correctness of constructing optimal alphabetic trees revisited
Theoretical Computer Science
The optimal alphabetic tree problem revisited
Journal of Algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Huffman codes and self-information
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In the partial alphabetic tree problem we are given a multiset of non-negative weights W={w"1,...,w"n}, partitioned into m=