𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improving the computational efficiency of metric-based spares algorithms

✍ Scribed by David R. Nowicki; Wesley S. Randall; Jose Emmanuel Ramirez-Marquez

Book ID
113583991
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
557 KB
Volume
219
Category
Article
ISSN
0377-2217

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