SCCMULTI is a new algorithm which eliminates the drawbacks of the previous algorithms and an experimental validation of SCCMULTI on a range of graphs. An experiment was conducted while implementing Divide-and-Conquer Strong Components (DCSC), MULTIPIVOT, and SCCMULTI using C++ and the STAPL library, a parallel library which provides a distributed graph. It was proved that SCCMULTI uses more pivots than DCSC, resulting in higher execution times on lower core counts.
- Parallel Graph Algorithms
- Randomized Algorithms
- Strongly Connected Components
ASJC Scopus subject areas
- Computer Science(all)