A division scheme for constructing minimal spanning trees in coordinate space

Choudhury, Sabyasachy and Murty, Narasimha M (1990) A division scheme for constructing minimal spanning trees in coordinate space. In: Pattern Recognition Letters, 11 (6). pp. 385-389.

PDF 389.pdf Restricted to Registered users only Download (329kB) | Request a copy

Abstract

An algorithm to generate a minimal spanning tree is presented when the nodes with their coordinates in some m-dimensional Euclidean space and the corresponding metric are given. This algorithm is tested on manually generated data sets. The worst case time complexity of this algorithm is $O(n log^2 n)$ for a collection of n data samples.

Item Type:	Journal Article
Publication:	Pattern Recognition Letters
Publisher:	Elsevier
Additional Information:	Copyright of this article belongs to Elsevier.
Keywords:	Nearest neighbour; intelligent partitioning; minimal spanning tree.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	07 Mar 2008
Last Modified:	19 Sep 2010 04:43
URI:	http://eprints.iisc.ac.in/id/eprint/13332

Actions (login required)

View Item