An optimal EREW parallel algorithm for c
โ
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