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 条
  • [41] NEW ALGORITHM FOR GENERATION OF SPANNING-TREES
    CHERKASSKII, BV
    CYBERNETICS, 1987, 23 (01): : 107 - 113
  • [42] MOST AND LEAST UNIFORM SPANNING-TREES
    CAMERINI, PM
    MAFFIOLI, F
    MARTELLO, S
    TOTH, P
    DISCRETE APPLIED MATHEMATICS, 1986, 15 (2-3) : 181 - 197
  • [43] GRAPHS WITH CERTAIN FAMILIES OF SPANNING-TREES
    ERDOS, P
    FAUDREE, RJ
    ROUSSEAU, CC
    SCHELP, RH
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1982, 32 (02) : 162 - 170
  • [44] SPANNING-TREES OF LOCALLY FINITE GRAPHS
    ZELINKA, B
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1989, 39 (02) : 193 - 197
  • [45] GROWTH-RATES OF EUCLIDEAN MINIMAL SPANNING-TREES WITH POWER WEIGHTED EDGES
    STEELE, JM
    ANNALS OF PROBABILITY, 1988, 16 (04): : 1767 - 1787
  • [46] UNRANKING AND RANKING SPANNING-TREES OF A GRAPH
    COLBOURN, CJ
    DAY, RPJ
    NEL, LD
    JOURNAL OF ALGORITHMS, 1989, 10 (02) : 271 - 286
  • [47] FINDING THE K SMALLEST SPANNING-TREES
    EPPSTEIN, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 38 - 47
  • [48] THE NUMBER OF SPANNING-TREES IN THE SQUARE OF A CYCLE
    BARON, G
    PRODINGER, H
    TICHY, RF
    BOESCH, FT
    WANG, JF
    FIBONACCI QUARTERLY, 1985, 23 (03): : 258 - 264
  • [49] GRAPHS WITH AN EXTREMAL NUMBER OF SPANNING-TREES
    KELMANS, AK
    JOURNAL OF GRAPH THEORY, 1980, 4 (01) : 119 - 122
  • [50] MULTICRITERION PROBLEMS OF GRAPH SPANNING-TREES
    EMELICHEV, VA
    PEREPELITSA, VA
    DOKLADY AKADEMII NAUK SSSR, 1988, 298 (03): : 544 - 547
12345