17
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

An upper bound for the average length of the euclidean minimum spanning tree

&
Pages 1-12 | Received 26 Apr 1988, Accepted 06 May 1988, Published online: 19 Mar 2007
 

Abstract

In this paper we estimate the average length of an Euclidean minimum spanning tree. If the vertices of an EMST are uniformly distributed on a unit disk in R 2 we can derive the behavior of the edge lengths of the EMST constructed from these vertices by using the ordered statistics, and obtain an upper bound for the expected length of an EMST to be where n is the number of vertices of the EMST. This estimation is much closer to the actual values than the previous results. Experiment values are also given.

C.R.Categories:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.