Fig. 3From: ANGEL: efficient, and effective, node-centric community discovery in static and dynamic networksANGEL parallelization schema. The graph G is decomposed in |V| ego-minus-ego network by a dispatcher D and distributed to n workers {\({LP}_{0},\dots, {LP}_{n}\)} that extract local communities from them. At the end of such parallel process, a collector C iteratively apply PRECISIONMERGE till obtaining the final overlapping partitionBack to article page