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.

Podrobná bibliografie
Vydáno v:Information processing letters. 61, 6 (1997).
Hlavní autor: Chao, H.S
Médium: Článek
Jazyk:English
Témata:
Parallel algorithms.
Permutation graphs.
Breadth-first search trees.