Concurrent Tarjan Algorithm for Strongly Connected Components Detection
Matheus do Ó and Daniel Arruda Ponte Final project for subject Parallel Computing, 2023 Link
Abstract
Tarjan's algorithm is a classic algorithm to find strongly connected component in directed graphs. We implement a parallel version in Java. The algorithm by itself is non-trivial to parallelize and we based our research into a scala implementation.