Parallelizing an algorithm to find communities using the Jaccard metric

Given a graph, there are many different reasons for finding communities in a graph. Numerous algorithms have been proposed for finding communities on graphs. Many of those algorithms are time consuming. The Jaccard metric, introduced in the context of the geographic location of botanical species, has been used to find communities. An algorithm to find communities based on the Jaccard metric was parallelized using OpenMP. Performance results are reported.