AN EREW PARM ALGORITHM FOR UPDATING MINIMUM SPANNING TREES
1999 ◽
Vol 09
(01)
◽
pp. 111-122
◽
Keyword(s):
We propose a parallel algorithm for the EREW PRAW model that maintains a minimum spanning tree (MST) of an undirected graph under single edge insertions and deletions. For a graph of n nodes and m edges, each update requires O( log n) time and O(m 2/3 log n) work. This is a substantial improvement over the known bounds on the work complexity. Our algorithm uses a partition of the MST, similar to the sequential approach due to Frederickson [6], and also employs a novel data structure for efficiently managing edge insertions in parallel.
2016 ◽
Vol 62
(4)
◽
pp. 379-388
◽
Keyword(s):
1996 ◽
Vol 06
(02)
◽
pp. 213-222
◽
Keyword(s):
2010 ◽
Vol 21
(04)
◽
pp. 471-480
◽
Keyword(s):
2015 ◽
Vol 2015
(2)
◽
pp. 188-205
◽
2010 ◽
Vol 1
(4)
◽
pp. 16-30
2017 ◽
Vol 5
(3)
◽
pp. 216-228
2014 ◽
Vol XL-8
◽
pp. 1105-1114
◽