PKavosh: A New Parallel Approach to Motif Finding

In networks, motifs are small-connected sub-graphs with higher fre-quency occurrence than in random networks. It has recently gathered much at-tention as a concept to uncover structural design principles of complex biologi-cal networks. Finding motifs in a network is a very challenging and time-consuming process. Several algorithms and improvements have been proposed. One of the best-known tools that can find motifs in a complex network is Ka-vosh. In this paper, we present a parallel version of Kavosh, named PKavosh, which uses parallel sub-graph enumeration for motif finding. Experimental re-sults show excellent scalability on this problem, achieving a speedup of 7 on 8 processors.