A DIVISIVE SCHEME FOR CONSTRUCTING MINIMAL SPANNING-TREES IN COORDINATE SPACE

被引：2
|
作者：
CHOUDHURY, S
MURTY, MN
机构：
[1] Department of Computer Science and Automation, Indian Institute of Science, Bangalore
来源：
PATTERN RECOGNITION LETTERS | 1990年 / 11卷 / 06期
关键词：
intelligent partitioning; minimal spanning tree; Nearest neighbour;
D O I：
10.1016/0167-8655(90)90108-E
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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. © 1990.
引用
收藏
页码：385 / 389
页数：5
相关论文
共 50 条
12345