The behavior of a greedy algorithm which estimates the height of a random, labelled rooted tree is studied. A self-similarity argument is used to characterize the limit distribution of the length H of the path found by such an algorithm in a random rooted tree as the unique solution of an integral equation. Furthermore, it is shown that [GRAPH] i.e., the expected length of the path constructed by the algorithm is roughly 93.8% of the expected height of a random rooted tree.
Fast Capture and Real-time Image Processing Laboratory, Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, China
论文数: 0引用数: 0
h-index: 0
Fast Capture and Real-time Image Processing Laboratory, Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, China