| dc.contributor.author | Jaillet, Patrick | en_US |
| dc.date.accessioned | 2004-05-28T19:27:33Z | |
| dc.date.available | 2004-05-28T19:27:33Z | |
| dc.date.issued | 1990-11 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5197 | |
| dc.description.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. | en_US |
| dc.format.extent | 380685 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
| dc.relation.ispartofseries | Operations Research Center Working Paper;OR 235-90 | en_US |
| dc.title | A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree | en_US |
| dc.type | Working Paper | en_US |
