✦ LIBER ✦

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

✍ Scribed by Hermann Jung; Kurt Mehlhorn

Book ID: 113163214
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 726 KB
Volume: 27
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90084-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for finding and updating mini

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

✍ Pranay Chaudhuri; Asad A. Ismaeel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 564 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

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

Optimal parallel algorithms for coloring

Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees

✍ G. Sajith; Sanjeev Saxena 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 474 KB

An adaptive and cost-optimal parallel al

An adaptive and cost-optimal parallel algorithm for minimum spanning trees

✍ S. G. Akl 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 388 KB

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