|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
1993 Seventh International Parallel Processing Symposium
A parallel algorithm for multiple edge updates of minimum spanning trees
Newport, CA USA
April 13-April 16
ISBN: 0-8186-3442-1
| ASCII Text | x | ||
| Shen, Liang, "A parallel algorithm for multiple edge updates of minimum spanning trees," Parallel Processing Symposium, International, pp. 310-317, 1993 Seventh International Parallel Processing Symposium, 1993. | |||
| BibTex | x | ||
| @article{ 10.1109/IPPS.1993.262898, author = { Shen and Liang}, title = {A parallel algorithm for multiple edge updates of minimum spanning trees}, journal ={Parallel Processing Symposium, International}, volume = {0}, year = {1993}, isbn = {0-8186-3442-1}, pages = {310-317}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPPS.1993.262898}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel Processing Symposium, International TI - A parallel algorithm for multiple edge updates of minimum spanning trees SN - 0-8186-3442-1 SP310 EP317 A1 - Shen, A1 - Liang, PY - 1993 KW - parallel algorithm KW - multiple edge updates KW - minimum spanning trees KW - undirected graph KW - SIMD CREW PRAM model VL - 0 JA - Parallel Processing Symposium, International ER - | |||
The authors present a parallel algorithm for the multiple edge update problem on a minimum spanning tree. This problem is defined as follows: given a minimum spanning tree T(V,E/sub T/) of an undirected graph G(V,E), where mod V mod =n and E/sub T/ is the set of tree edges, recompute a new minimum spanning tree when (1) adding K new edges, (2) changing the weights of existent K edges, or (3) deleting a vertex of degree K in the tree, where 1<or=K<n. Their algorithm requires O(logKlogn) time and O(n/sup 2//lognlogK) processors on a SIMD CREW PRAM model. If the weights of the current tree edges are not allowed to increase, then their algorithm runs in the same time bound, but only using O(max(n,nK/lognlogK)) processors. Their algorithm is optimal for dense graphs, if no intermediate results are available from computing the original MST.
Index Terms:
parallel algorithm, multiple edge updates, minimum spanning trees, undirected graph, SIMD CREW PRAM model
Citation:
Shen, Liang, "A parallel algorithm for multiple edge updates of minimum spanning trees," ipps, pp.310-317, 1993 Seventh International Parallel Processing Symposium, 1993
Usage of this product signifies your acceptance of the Terms of Use.