Regular ArticleParallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs
References (0)
Cited by (3)
Nearly work-efficient parallel algorithm for digraph reachability
2020, SIAM Journal on ComputingNearly work-Efficient parallel algorithm for digraph reachability
2018, Proceedings of the Annual ACM Symposium on Theory of Computing
Copyright © 1993 Academic Press. All rights reserved.