Tight bounds for top tree compression

DOI10.1007/978-3-319-67428-5_9MaRDI QIDQ5150922zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Philip Bille, Finn Fernstrøm, Inge Li Gørtz

Publication date 16 February 2021

Published in String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-67428-5_9

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Slowing down top trees for better worst-case compression
• Tree compression with top trees
• Tree compression with top trees
• Size-optimal top dag compression
• XML compression via directed acyclic graphs

Cites work

• scientific article; zbMATH DE number 1617247 (Why is no real title available?)
• Minimizing diameters of dynamic trees
• Tree compression with top trees
• Variations on the Common Subexpression Problem

Cited in

(13)

• Top tree compression of tries
• Balancing straight-line programs for strings and trees
• Tree compression with top trees
• Size-optimal top dag compression
• XML compression via directed acyclic graphs
• Compression of unordered XML trees
• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
• Lossless Compression of Binary Trees With Correlated Vertex Names
• Efficiency of lossless compression of a binary tree via its minimal directed acyclic graph representation
• Slowing down top trees for better worst-case compression
• Tree compression with top trees
• Compressing branch-and-bound trees
• Slowing down top trees for better worst-case compression

This page was built for publication: Tight bounds for top tree compression

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