Exhaustive Community Enumeration in Parallel
Christian I. Trefftz, Hugh McGuire, Zachary Kurmas, Jerry Scripps · Parallel Processing Letters · 2016
An algorithm to evaluate/count all the possible communities of a graph is presented. An associated unrank function is described. An implementation of an existing algorithm to evaluate all the possible partitions of a graph, based on an unrank function, is presented as well. Performance results of the parallelizations of these algorithms obtained on a shared memory machine, a cluster of workstations and a Graphical Processing Unit (GPU) are included.