On a Recurrence Arising in Graph Compression

Electronic Journal Of Combinatorics

Yongwook Choi¹ 

关键词: Digital trees;    Mellin transform;    poissonization;    graph compression;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In a recently proposed graphical compression algorithm by Choi and Szpankowski (2012), the following tree arose in the course of the analysis. The root contains $n$ balls that are consequently distributed between two subtrees according to a simple rule: I

【 授权许可】

Others