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.

Detalles Bibliográficos
Publicado en:Information processing letters. 61, 6 (1997).
Autor principal: Chao, H.S
Formato: Artículo
Lenguaje:English
Materias:
Parallel algorithms.
Permutation graphs.
Breadth-first search trees.