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

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

Bibliografische gegevens
Gepubliceerd in:Information processing letters. 61, 6 (1997).
Hoofdauteur: Chao, H.S
Formaat: Artikel
Taal:English
Onderwerpen:
Parallel algorithms.
Permutation graphs.
Breadth-first search trees.