Memory size bounds of prefix DAGs
arXiv:1305.5662
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.
arXiv comment3 pages, G. Rétvári, J. Tapolcai, A. Kőrösi, A. Majdán, Z. Heszberger, "Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond", In ACM Sigcomm, 2013