Back to Search
Start Over
Memory size bounds of prefix DAGs
Memory size bounds of prefix DAGs
- Publication Year :
- 2013
-
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.<br />Comment: 3 pages, G. R\'etv\'ari, J. Tapolcai, A. K\H{o}r\"osi, A. Majd\'an, Z. Heszberger, "Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond", In ACM Sigcomm, 2013
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1305.5662
- Document Type :
- Working Paper