Chao, H. An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs. Information processing letters..
Chicago Style (17th ed.) CitationChao, H.S. "An Optimal EREW Parallel Algorithm for Computing Breadth-first Search Trees on Permutation Graphs." Information Processing Letters. .
MLA (9th ed.) CitationChao, H.S. "An Optimal EREW Parallel Algorithm for Computing Breadth-first Search Trees on Permutation Graphs." Information Processing Letters., .
Warning: These citations may not always be 100% accurate.