Depth—First Search of Random Trees, and Poisson Point Processes

  • Geiger J
  • Kersting G
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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...

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free