An algorithm for tree structure compression

Author

Van Houten, Karen ; Oman, Paul W.

Author_Institution

Dept. of Comput Sci., Idaho Univ., Moscow, ID, USA

fYear

1991

fDate

8-11 Apr 1991

Firstpage

424

Abstract

Extended summary form only given. The authors show the existence of a bijective mapping between representative binary strings and tree structures through four theorems. Using these proofs they create an algorithm for generating representative binary strings directly from commonly used graph data structures. This technique effectively compresses the structure of a tree with n nodes into 2n-1 bits plus the original information contained within the tree

Keywords

binary sequences; data compression; data structures; trees (mathematics); algorithm; bijective mapping; graph data structures; representative binary strings; tree structure compression; Binary trees; Compression algorithms; Computer science; Data communication; Data structures; Information retrieval; Software engineering; Tree data structures; Tree graphs; Vegetation mapping;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1991. DCC '91.

Conference_Location

Snowbird, UT

Print_ISBN

0-8186-9202-2

Type

conf

DOI

10.1109/DCC.1991.213337

Filename

213337

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3145856