Name
Abstract | ||
|---|---|---|
A skeleton Huffman tree is a Huffman tree from which all full subtrees of depth h >= 1 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. (C) 2020 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.tcs.2020.11.025 | THEORETICAL COMPUTER SCIENCE |
Keywords | DocType | Volume |
Data compression, Huffman tree, Skeleton tree, Reduced skeleton | Journal | 852 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shmuel T. Klein | 1 | 434 | 77.80 |
| Jakub Radoszewski | 2 | 624 | 50.36 |
| Tamar C. Serebro | 3 | 0 | 0.68 |
| Dana Shapira | 4 | 144 | 32.15 |