Lossless Compression of Binary Trees With Correlated Vertex Names

DOI10.1109/TIT.2018.2851224MaRDI QIDQ4682896zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Abram Magner, Krzysztof Turowski, Wojciech Szpankowski

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2018.2851224

Mathematics Subject Classification ID

Data structures (68P05) Source coding (94A29)

Recommendations

• Efficiency of lossless compression of a binary tree via its minimal directed acyclic graph representation
• A Universal Grammar-Based Code for Lossless Compression of Binary Trees
• A compact encoding of unordered binary trees
• Compressing and indexing labeled trees, with applications
• Lossless compression algorithm based on context tree
• Compressing branch-and-bound trees
• Algorithmic height compression of unordered trees
• Fully-Compressed Suffix Trees
• Tight bounds for top tree compression

Cited in

(2)

• Compaction for two models of logarithmic‐depth trees: Analysis and experiments
• Compression of dynamic graphs generated by a duplication model

This page was built for publication: Lossless Compression of Binary Trees With Correlated Vertex Names

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682896)