A divisive scheme for constructing minimal spanning trees in coordinate space


Autoria(s): Choudhury, Sabyasachy; Murty, Narasimha M
Data(s)

01/06/1990

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/34863/1/Divisive.pdf

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.

Publicador

Elsevier Science

Relação

http://dx.doi.org/10.1016/0167-8655(90)90108-E

http://eprints.iisc.ernet.in/34863/

Palavras-Chave #Computer Science & Automation (Formerly, School of Automation)
Tipo

Journal Article

PeerReviewed