✦ LIBER ✦

Graph algorithms on a tree-structured parallel computer

✍ Scribed by D. Y. Yeh; D. T. Lee

Publisher: Springer Netherlands
Year: 1984
Tongue: English
Weight: 438 KB
Volume: 24
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf02136031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding fundamental cycles and bridges o

Finding fundamental cycles and bridges on a tree-structured parallel computer

✍ D.Y. Yeh 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Parallel computation on interval graphs:

Parallel computation on interval graphs: algorithms and experiments

✍ A. Ferreira; I. Guérin Lassous; K. Marcus; A. Rau-Chaplin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

An optimal EREW parallel algorithm for c

An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs

✍ H.S. Chao; F.R. Hsu; R.C.T. Lee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Given a undirected graph G, the breadth-first search tree is constructed by a breadth-first search on G. In this paper, an optimal parallel algorithm is presented for constructing the breadth-first search tree for permutation graphs in O(log n) time by using O(n/Iog n) processors under the EREW PRAM

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

Parallel algorithms on graphs

✍ E. A. Ivanov 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 339 KB

Pipelining tree-structured algorithms on

Pipelining tree-structured algorithms on SIMD architectures

✍ D.T. Barnard; D.B. Skillicorn 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 493 KB