✦ LIBER ✦

Parallel Algorithms for Minimum Spanning Tree Problem

✍ Scribed by Ahrabian, H.; Nowzari-Dalini, A.

Book ID: 126547907
Publisher: Taylor and Francis Group
Year: 2002
Tongue: English
Weight: 116 KB
Volume: 79
Category: Article
ISSN: 0020-7160
DOI: 10.1080/00207160210945

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(log m) parallel algorithm for the m

An O(log m) parallel algorithm for the minimum spanning tree problem

✍ Francis Suraweera; Prabir Bhattacharya 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 KB

[IEEE Comput. Soc International Conferen

[IEEE Comput. Soc International Conference on Parallel Processing Workshop - Vancouver, BC, Canada (18-21 Aug. 2002)] Proceedings. International Conference on Parallel Processing Workshop - Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique

✍ Li-Jen Mao, ; Sheau-Dong Lang, 📂 Article 📅 2002 🏛 IEEE Comput. Soc ⚖ 307 KB

A parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

✍ Jon Louis Bentley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 521 KB

A Parallel Algorithm for Computing Minim

A Parallel Algorithm for Computing Minimum Spanning Trees

✍ D.B. Johnson; P. Metaxas 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i

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

Offline Algorithms for Dynamic Minimum S

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

✍ D. Eppstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 651 KB

We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm takes time \(O(k \log n)\) for a seq