A divisive scheme for constructing minimal spanning trees in coordinate space

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

PDF Divisive.pdf - Published Version 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 log2n) for a collection of n data samples.

Item Type:	Journal Article
Publication:	Pattern Recognition Letters
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science.
Keywords:	Nearest neighbour; intelligent partitioning; minimal spanning tree
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	06 Jan 2011 12:00
Last Modified:	06 Jan 2011 12:00
URI:	http://eprints.iisc.ac.in/id/eprint/34863

Actions (login required)

View Item