H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee. An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs. Inf. Process. Lett., 61(6):311-316, 1997. [doi]
@article{ChaoHL97,
title = {An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs},
author = {H. S. Chao and Fang-Rong Hsu and Richard C. T. Lee},
year = {1997},
doi = {10.1016/S0020-0190(97)00009-4},
url = {http://dx.doi.org/10.1016/S0020-0190(97)00009-4},
tags = {graph-rewriting, C++, rewriting, search},
researchr = {https://researchr.org/publication/ChaoHL97},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {61},
number = {6},
pages = {311-316},
}