A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree
Name
OR-235-90.pdf
Size
371.76 KB
Format
Adobe PDF
Checksum (MD5)
c6c336233ee50ea8425e9eba381a42e9
Author(s)
Jaillet, Patrick
Date Issued
November 1990
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 235-90
Abstract
We show that the number of vertices of degree k in the Euclidean minimal spanning tree through points drawn uniformly from either the d-dimensional torus or from the d-cube, d > 2, are asymptotically equivalent with probability one. Implications are discussed.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
