Kapak Resmi

An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs.

Detaylı Bibliyografya
Yayımlandı:Information processing letters. 61, 6 (1997).
Yazar: Chao, H.S
Materyal Türü: Makale
Dil:İngilizce
Konular:
Parallel algorithms.
Permutation graphs.
Breadth-first search trees.