Memory size bounds of prefix DAGs

Attila K\H{o}r\"osi; G\'abor R\'etv\'ari; J\'anos Tapolcai

arxiv: 1305.5662 · v1 · pith:LWPLVKVUnew · submitted 2013-05-24 · 💻 cs.DS · cs.IT· math.IT

Memory size bounds of prefix DAGs

J\'anos Tapolcai , G\'abor R\'etv\'ari , Attila K\H{o}r\"osi This is my paper

classification 💻 cs.DS cs.ITmath.IT

keywords compressionmemorysizeacyclicboundboundsconvertsdags

0 comments

read the original 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.

This paper has not been read by Pith yet.

Memory size bounds of prefix DAGs

discussion (0)