Name
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. |
Year | Venue | Field |
|---|---|---|
2013 | CoRR | Discrete mathematics,Combinatorics,Directed acyclic graph,Prefix,Isomorphism,Merge (version control),Mathematics |
DocType | Volume | Citations |
Journal | abs/1305.5662 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| János Tapolcai | 1 | 364 | 41.42 |
| Gábor Rétvári | 2 | 194 | 24.87 |
| Attila Körösi | 3 | 44 | 5.58 |