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.

Bibliografski detalji
Izdano u:Information processing letters. 61, 6 (1997).
Glavni autor: Chao, H.S
Format: Članak
Jezik:English
Teme:
Parallel algorithms.
Permutation graphs.
Breadth-first search trees.