Memory size bounds of prefix DAGs
J\'anos Tapolcai, G\'abor R\'etv\'ari, Attila K\H{o}r\"osi
TL;DR
This paper establishes an entropy-based bound on the memory size required for compressing leaf-labeled trees into prefix DAGs by merging isomorphic subtrees.
Contribution
It introduces a theoretical entropy bound for the memory size of prefix DAGs derived from leaf-labeled trees.
Findings
Entropy bound on memory size for prefix DAGs
Compression efficiency depends on subtree isomorphism
Provides theoretical limits for tree compression methods
Abstract
In this report an entropy bound on the memory size is given for a compression method of leaf-labeled trees. The compression converts the tree into a Directed Acyclic Graph (DAG) by merging isomorphic subtrees.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Graph Theory Research · Algorithms and Data Compression