A Parallel Algorithm for Finding All Elementary Circuits of a Directed Graph

Graph can be used as a significant model to simulate the real world. We can find this kind of models in many different fields, such as transportation, navigation, logistics, management and social networks. In such graphs, a circuit is often regarded as a closed-loop way by which information propagates. There are several algorithms for finding all elementary circuits. Among these algorithms, Jonson's algorithm suffers the lowest time complexity so far. In this paper, we introduce a parallel algorithm based on Johnson's algorithm. We demonstrate that it is capable to handle large-scale graphs with a computing cluster. Experiments on both synthetic and real-world data sets demonstrate the effectiveness of the proposed algorithm.