Distributed Algorithms for SCC Decomposition

作者：Barnat Jiri^*; Chaloupka Jakub; van de Pol Jaco

来源：Journal of Logic and Computation, 2011, 21(1): 23-44.

DOI：10.1093/logcom/exp003

• parallel algorithms
• strongly connected components

We study existing parallel algorithms for the decomposition of a partitioned graph into its strongly connected components (SCCs). In particular, we identify several individual procedures that the algorithms are assembled from and show how to assemble a new and more efficient algorithm, called Recursive OBF (OBFR), to solve the decomposition problem. We also report on a thorough experimental study to evaluate the new algorithm. It shows that it is possible to perform SCC decomposition in parallel efficiently and that OBFR, if properly implemented, is the best choice in most cases.

• 出版日期2011-2