A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5197

Full metadata record

DC Field	Value	Language
dc.creator	Jaillet, Patrick	-
dc.date	2004-05-28T19:27:33Z	-
dc.date	2004-05-28T19:27:33Z	-
dc.date	1990-11	-
dc.date.accessioned	2013-10-09T02:38:16Z	-
dc.date.available	2013-10-09T02:38:16Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5197	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	380685 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 235-90	-
dc.title	A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI