๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Maintaining B-Trees on an EREW PRAM

โœ Scribed by L. Higham; E. Schenk

Book ID
102973633
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
708 KB
Volume
22
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An optimal EREW PRAM algorithm for minim
An optimal EREW PRAM algorithm for minimum spanning tree verification
โœ Valerie King; Chung Keung Poon; Vijaya Ramachandran; Santanu Sinha ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 661 KB

We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(logn) time and O(m + n) work. The algorithm is a parallelization of King's linear time sequential algorithm for the proble

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