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 条
  • [31] Maintaining dynamic minimum spanning trees: An experimental study
    Cattaneo, G
    Faruolo, P
    Petrillo, UF
    Italiano, GF
    ALGORITHM ENGINEERING AND EXPERIMENTS, 2002, 2409 : 111 - 125
  • [32] Fast Approximation Algorithms for Computing Constrained Minimum Spanning Trees
    Yao, Pei
    Guo, Longkun
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT I, 2017, 10627 : 103 - 110
  • [33] Energy-Optimal Distributed Algorithms for Minimum Spanning Trees
    Choi, Yongwook
    Khan, Maleq
    Kumar, V. S. Anil
    Pandurangan, Gopal
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (07) : 1297 - 1304
  • [34] Optimal representation of the minimum spanning tree algorithm in associative parallel processors
    Nepomnyashchaya, AS
    CYBERNETICS AND SYSTEMS ANALYSIS, 1995, 31 (04) : 475 - 483
  • [35] Competitive maintenance of minimum spanning trees in dynamic graphs
    Dynia, Miroslaw
    Korzeniowski, Miroslaw
    Kutylowski, Jaroslaw
    SOFSEM 2007: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2007, 4362 : 260 - +
  • [36] Maintaining dynamic minimum spanning trees: An experimental study
    Cattaneo, G.
    Faruolo, P.
    Petrillo, U. Ferraro
    Italiano, G. F.
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (05) : 404 - 425
  • [37] A PARALLEL ALGORITHM FOR MULTIPLE UPDATES OF MINIMUM SPANNING-TREES
    PAWAGI, S
    PROCEEDINGS OF THE 1989 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, VOL 3: ALGORITHMS AND APPLICATIONS, 1989, : 9 - 15
  • [38] Optimal parallel verification of minimum spanning trees in logarithmic time
    B. Dixon
    R. E. Tarjan
    Algorithmica, 1997, 17 : 11 - 18
  • [39] Concurrent threads and optimal parallel minimum spanning trees algorithm
    Chong, KW
    Han, YJ
    Lam, TW
    JOURNAL OF THE ACM, 2001, 48 (02) : 297 - 323
  • [40] MINIMUM SPANNING TREES IN INFINITE GRAPHS: THEORY AND ALGORITHMS\ast
    Ryan, Christopher t.
    Smith, Robert l.
    Epelman, Marina a.
    SIAM JOURNAL ON OPTIMIZATION, 2024, 34 (03) : 3112 - 3135
12345