Philip N. Klein. Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs. J. Algorithms, 14(3):331-343, 1993.
@article{Klein93-0,
title = {Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs},
author = {Philip N. Klein},
year = {1993},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Klein93-0},
cites = {0},
citedby = {0},
journal = {J. Algorithms},
volume = {14},
number = {3},
pages = {331-343},
}