Fig. 4From: Detecting and generating overlapping nested communitiesSteps of the community detection algorithm. Starting from the input graph (a), we first compact vertices with equal neighborhoods (b), then build the community graph (c), and finally reverse the vertex compaction, adding the bidirectional edgesBack to article page