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

https://doi.org/10.1016/S0020-0190(97)00009-4Get rights and content

Abstract

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/log n) processors under the EREW PRAM model, where n is the number of nodes of the graph.

References (5)

There are more references available in the full text version of this article.

Cited by (2)

View full text