2013/05/24 by János Tapolcai, Tapolcai, János, Gábor Rétvári +3
Computer Science · #semigroups and automata theory #Advanced Graph Theory Research #Algorithms and Data Compression
paper · pdf · doi:10.48550/arxiv.1305.5662
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.