Associative parallel algorithms for dynamic edge update of minimum spanning trees

被引：0
|
作者：
Nepomniaschaya, AS [1 ]
机构：
[1] Russian Acad Sci, Siberian Div, Inst Computat Math & Math Geophys, Novosibirsk 630090, Russia
来源：
PARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS | 2003年 / 2763卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we propose two associative parallel algorithms for the edge update of a minimum spanning tree when an edge is deleted or inserted in the underlying graph. These algorithms are represented as the corresponding procedures implemented on a model of associative parallel systems of the SIMD type with vertical data processing (the STAR-machine). We justify correctness of these procedures and evaluate their time complexity.
引用
收藏
页码：141 / 150
页数：10
相关论文
共 50 条
  • [1] Practical parallel algorithms for minimum spanning trees
    Dehne, F
    Götz, S
    SEVENTEENTH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 1998, : 366 - 371
  • [2] Distributed Memory Parallel Algorithms for Minimum Spanning Trees
    Loncar, Vladmir
    Skrbic, Srdjan
    Balaz, Antun
    WORLD CONGRESS ON ENGINEERING - WCE 2013, VOL II, 2013, : 1271 - +
  • [3] ASSOCIATIVE PARALLEL ALGORITHM FOR DYNAMIC UPDATE OF A MINIMUM SPANNING TREE AFTER ADDITION OF A NEW NODE TO A GRAPH
    Nepomniaschaya, A. Sh.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2006, 42 (01) : 18 - 27
  • [4] OPTIMAL PARALLEL ALGORITHMS FOR MULTIPLE UPDATES OF MINIMUM SPANNING-TREES
    PAWAGI, S
    KASER, O
    ALGORITHMICA, 1993, 9 (04) : 357 - 381
  • [5] Algorithms for finding and updating minimum-depth spanning trees in parallel
    Chaudhuri, P
    Ismaeel, AA
    INFORMATION SCIENCES, 1995, 87 (1-3) : 171 - 183
  • [6] On minimum edge ranking spanning trees
    Makino, K
    Uno, Y
    Ibaraki, T
    JOURNAL OF ALGORITHMS, 2001, 38 (02) : 411 - 437
  • [7] AN O(LOG N) ALGORITHM FOR PARALLEL UPDATE OF MINIMUM SPANNING-TREES
    PAWAGI, S
    RAMAKRISHNAN, IV
    INFORMATION PROCESSING LETTERS, 1986, 22 (05) : 223 - 229
  • [8] PARALLEL ALGORITHMS FOR COMPUTING MAXIMAL INDEPENDENT SETS IN TREES AND FOR UPDATING MINIMUM SPANNING-TREES
    JUNG, H
    MEHLHORN, K
    INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 227 - 236
  • [9] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
    HSU, LH
    WANG, PF
    WU, CT
    PARALLEL COMPUTING, 1992, 18 (10) : 1143 - 1155
  • [10] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
    HSU, LH
    WANG, PF
    WU, CT
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 284 - 290
12345