Size-optimal top dag compression

DOI10.1016/j.ipl.2019.03.001zbMath1473.68061arXiv1712.05822OpenAlexW2921285409MaRDI QIDQ2414042

Carl Philipp Reh, Kurt Sieber, Markus Lohrey

Publication date: 10 May 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.05822

zbMATH Keywords

algorithmsdata structurestree compression

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Grammar-based compression of unranked trees

Cites Work

• Tree compression with top trees
• Constructing small tree grammars and small circuits for formulas
• Grammar-Based Tree Compression
• Variations on the Common Subexpression Problem
• Slowing Down Top Trees for Better Worst-Case Compression
• Tight Bounds for Top Tree Compression
• Grammar-based compression of unranked trees