Does anyone know of a parallel version of the Tarjan SCCs algorithm, the Kosaraju algorithm, or any other fast O (| V | + | E |) algorithm for finding SCC? None of these algorithms seem to be very multithreaded, but I would be glad if someone else did the job. What I'm trying to process here is an 8 gigabyte oriented graph, which I store in RAM using a large instance of AWS, and I would like to use all 16 cores.
source
share