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 条
12345