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 条
  • [1] A Divide-and-Conquer Algorithm for All Spanning Tree Generation
    Chakraborty, Maumita
    Mehera, Ranjan
    Pal, Rajat Kumar
    ADVANCED COMPUTING AND SYSTEMS FOR SECURITY, VOL 3, 2017, 567 : 19 - 36
  • [2] Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
    Chakraborty, Maumita
    Mehera, Ranjan
    Pal, Rajat Kumar
    THEORETICAL COMPUTER SCIENCE, 2022, 900 : 35 - 52
  • [3] A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering
    Wang, Xiaochun
    Wang, Xiali
    Wilkes, Mitchell
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (07) : 945 - 958
  • [4] A divide-and-conquer discretization algorithm
    Min, F
    Xie, LJ
    Liu, QH
    Cai, HB
    FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 1277 - 1286
  • [5] A DIVIDE-AND-CONQUER ALGORITHM FOR GRID GENERATION
    DOUGHERTY, RL
    HYMAN, JM
    APPLIED NUMERICAL MATHEMATICS, 1994, 14 (1-3) : 125 - 134
  • [6] A divide-and-conquer algorithm for curve fitting
    Buchinger, Diego
    Rosso Jr, Roberto Silvio Ubertino
    COMPUTER-AIDED DESIGN, 2022, 151
  • [7] A DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD
    GU, M
    EISENSTAT, SC
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (01) : 79 - 92
  • [8] Fast broadcast by the divide-and-conquer algorithm
    Kim, DY
    Kim, DS
    2004 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING, 2004, : 487 - 488
  • [9] DIVIDE-AND-CONQUER
    SAWYER, P
    CHEMICAL ENGINEER-LONDON, 1990, (484): : 36 - 38
  • [10] DIVIDE-AND-CONQUER
    JEFFRIES, T
    BYTE, 1993, 18 (03): : 187 - &
12345