Efficient Lossless Compression of Trees and Graphs (1996)
by
Shenfeng Chen
,
John H. Reif
| Venue: | In IEEE Data Compression Conference (DCC |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Chen96efficientlossless,
author = {Shenfeng Chen and John H. Reif},
title = {Efficient Lossless Compression of Trees and Graphs},
booktitle = {In IEEE Data Compression Conference (DCC},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we study the problem of compressing a data structure (e.g. tree, undirected and directed graphs) in an efficient way while keeping a similar structure in the compressed form. To date, there has been no proven optimal algorithm for this problem. We use the idea of building LZW tree in LZW compression to compress a binary tree generated by a stationary ergodic source in an optimal manner. We also extend our tree compression algorithm to compress undirected and directed acyclic graphs.
Citations
| 7321 | Introduction to Algorithms - Cormen, Leiserson, et al. - 2001 |
| 965 | A universal algorithm for sequential data compression - Ziv, Lempel - 1977 |
| 605 | The Art of Computer Programming, Volume 3: Sorting and Searching - Knuth - 1998 |
| 15 | Using difficulty of prediction to decrease computation: Fast sort, priority queue and convex hull on entropy bounded inputs - Chen, Reif - 1993 |
| 4 | Graph matching in operational semantics and typing - Holm - 1990 |
| 3 | on a theme by Ziv and Lempel, Combinatorial algorithms on words, edited by A.Apostolico and Z.Galil - Miller, Wegman |
