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.

Dades bibliogràfiques
Publicat a:Information processing letters. 61, 6 (1997).
Autor principal: Chao, H.S
Format: Article
Idioma:English
Matèries:
Parallel algorithms.
Permutation graphs.
Breadth-first search trees.