Tree compression with top trees

DOI10.1007/978-3-642-39206-1_14zbMATH Open1327.68084OpenAlexW2145136569WikidataQ56813220 ScholiaQ56813220MaRDI QIDQ5326558FDOQ5326558

Authors: Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann 

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_14

Recommendations

• Tree compression with top trees
• Slowing down top trees for better worst-case compression
• Tight bounds for top tree compression
• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
• Size-optimal top dag compression

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10)

Cited In (9)

• Grammar-Based Tree Compression
• Tree compression with top trees
• Approximation of trees by self-nested trees
• Encoding trees by linear recurrence sequences
• Algorithmic height compression of unordered trees
• Tight bounds for top tree compression
• Compressing and indexing labeled trees, with applications
• Size-optimal top dag compression
• Slowing down top trees for better worst-case compression

This page was built for publication: Tree compression with top trees

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