Random planar trees can be represented by point processes in the upper positive quadrant of the plane. This proves helpful in studying the distance—from—theroot process of the depth—first search: For certain splitting trees this so—called...
CITATION STYLE
Geiger, J., & Kersting, G. (1997). Depth—First Search of Random Trees, and Poisson Point Processes (pp. 111–126). https://doi.org/10.1007/978-1-4612-1862-3_8
Mendeley helps you to discover research relevant for your work.