A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree
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.
Main Author: | Jaillet, Patrick |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5197 |
Similar Items
-
Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant
by: Jaillet, Patrick
Published: (2004) -
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
by: Wang, Yiqiu, et al.
Published: (2022) -
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
by: Wang, Yiqiu, et al.
Published: (2022) -
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering (Abstract)
by: Wang, Yiqiu, et al.
Published: (2023) -
The number of spanning trees in a superprism
by: Zbigniew R. Bogdanowicz
Published: (2024-04-01)