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.

Xehetasun bibliografikoak
Argitaratua izan da:Information processing letters. 61, 6 (1997).
Egile nagusia: Chao, H.S
Formatua: Artikulua
Hizkuntza:English
Gaiak:
Parallel algorithms.
Permutation graphs.
Breadth-first search trees.