ON A PROPOSED DIVIDE-AND-CONQUER MINIMAL SPANNING TREE ALGORITHM

被引：0
|
作者：
STOJMENOVIC, I
LANGSTON, MA
机构：
[1] WASHINGTON STATE UNIV,DEPT COMP SCI,PULLMAN,WA 99164
[2] UNIV MIAMI,DEPT MATH & COMP SCI,CORAL GABLES,FL 33124
[3] UNIV NOVI SAD,INST MATH,YU-21000 NOVI SAD,YUGOSLAVIA
来源：
BIT | 1988年 / 28卷 / 04期
关键词：
D O I：
10.1007/BF01954898
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：785 / 791
页数：7
相关论文
共 50 条
  • [31] MULTIDIMENSIONAL DIVIDE-AND-CONQUER
    BENTLEY, JL
    COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229
  • [32] A FASTER DIVIDE-AND-CONQUER ALGORITHM FOR CONSTRUCTING DELAUNAY TRIANGULATIONS
    DWYER, RA
    ALGORITHMICA, 1987, 2 (02) : 137 - 151
  • [33] A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers
    Wang, H
    Guo, MY
    Wei, DM
    JOURNAL OF SUPERCOMPUTING, 2004, 29 (02): : 157 - 170
  • [34] A DIVIDE-AND-CONQUER ALGORITHM FOR COMPUTING SINGULAR-VALUES
    CHANDRASEKARAN, S
    IPSEN, ICF
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1994, 74 (06): : T532 - T534
  • [35] Divide-and-conquer minimal-cut bisectioning of task graphs
    Lor, S
    Shen, H
    Maheshwari, P
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1996, 11 (04): : 227 - 234
  • [36] Divide-and-Conquer Learning with Nystrom: Optimal Rate and Algorithm
    Yin, Rong
    Liu, Yong
    Lu, Lijing
    Wang, Weiping
    Meng, Dan
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 6696 - 6703
  • [37] AN ACCELERATED DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD PROBLEM
    Li, Shengguo
    Gu, Ming
    Cheng, Lizhi
    Chi, Xuebin
    Sun, Meng
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2014, 35 (03) : 1038 - 1057
  • [38] A DIVIDE-AND-CONQUER ALGORITHM FOR CONSTRUCTING RELATIVE NEIGHBORHOOD GRAPH
    HUANG, NF
    BIT, 1990, 30 (02): : 196 - 206
  • [39] A PRACTICAL DIVIDE-AND-CONQUER ALGORITHM FOR THE RECTANGLE INTERSECTION PROBLEM
    GUTING, RH
    SCHILLING, W
    INFORMATION SCIENCES, 1987, 42 (02) : 95 - 112
  • [40] Divide-and-conquer algorithm for creating neighborhood graph for clustering
    Virmajoki, O
    Fränti, P
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 1, 2004, : 264 - 267
12345