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.

書誌詳細
出版年:Information processing letters. 61, 6 (1997).
第一著者: Chao, H.S
フォーマット: 論文
言語:English
主題:
Parallel algorithms.
Permutation graphs.
Breadth-first search trees.