Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs

Philip N. Klein. Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs. J. Algorithms, 14(3):331-343, 1993.

Abstract

Abstract is missing.