Parallelizing FluidC, a Community Finding Algorithm

FluidC is an algorithm to find communities on networks (graphs). Like the Label Propagation algorithm, the algorithm must update one vertex at a time. Otherwise, the algorithm does not converge on bipartite or nearly bipartite graphs. We have parallelized the FluidC algorithm using OpenMP and good speedups are observed. For the case of bipartite or nearly bipartite graphs, we revert to the sequential algorithm.