✦ LIBER ✦

Algorithms for finding and updating minimum-depth spanning trees in parallel

✍ Scribed by Pranay Chaudhuri; Asad A. Ismaeel

Book ID: 107767594
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 564 KB
Volume: 87
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(95)00135-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for computing maxima

Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees

✍ Hermann Jung; Kurt Mehlhorn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 726 KB

An O(log n) algorithm for parallel updat

An O(log n) algorithm for parallel update of minimum spanning trees

✍ Shaunak Pawagi; I.V. Ramakrishnan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 530 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

Efficient algorithms for finding minimum

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

✍ Harold N. Gabow; Zvi Galil; Thomas Spencer; Robert E. Tarjan 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 939 KB

An Algorithm for Finding K Minimum Spann

An Algorithm for Finding K Minimum Spanning Trees

✍ Katoh, N.; Ibaraki, T.; Mine, H. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 964 KB