๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal representation of the minimum spanning tree algorithm in associative parallel processors

โœ Scribed by A. Sh. Nepomnyashchaya

Publisher
Springer US
Year
1995
Tongue
English
Weight
613 KB
Volume
31
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improving the efficiency of parallel min
Improving the efficiency of parallel minimum spanning tree algorithms
โœ Ka Wong Chong; Yijie Han; Yoshihide Igarashi; Tak Wah Lam ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 203 KB

This paper presents results which improve the e ciency of parallel algorithms for computing the minimum spanning trees. For an input graph with n vertices and m edges our EREW PRAM algorithm runs in O(log n) time with O((m+n) log n) operations. Our CRCW PRAM algorithm runs in O(log n) time with O((m