当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimal skeleton and reduced Huffman trees
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2020-11-20 , DOI: 10.1016/j.tcs.2020.11.025
Shmuel T. Klein , Jakub Radoszewski , Tamar C. Serebro , Dana Shapira

A skeleton Huffman tree is a Huffman tree from which all full subtrees of depth h1 have been pruned. Skeleton Huffman trees are used to save storage and enhance processing time in several applications such as decoding, compressed pattern matching and wavelet trees for random access. A reduced skeleton tree prunes the skeleton Huffman tree further to an even smaller tree. The resulting more compact trees can be used to further enhance the time and space complexities of the corresponding algorithms. However, it is shown that the straightforward ways of basing the constructions of a skeleton tree as well as that of a reduced skeleton tree on a canonical Huffman tree do not necessarily yield the least number of nodes. New algorithms for achieving such trees are given.



中文翻译:

最佳骨架和简化的霍夫曼树

霍夫曼骨架树是霍夫曼树,所有深度子树都来自该树 H1个被修剪了。骨架霍夫曼树可用于节省存储空间并延长处理时间,可用于多种应用,例如解码,压缩模式匹配和用于随机访问的小波树。简化的骨架树将骨架霍夫曼树修剪为更小的树。所得的更紧凑的树可用于进一步增强相应算法的时间和空间复杂度。但是,已经表明,在规范化的霍夫曼树上建立骨架树以及简化骨架树的构造的直接方法不一定会产生最少数量的节点。给出了实现此类树的新算法。

更新日期:2020-12-13
down
wechat
bug