Table 2 Details of the algorithms used in this study. A summary of the strategies implemented by the algorithms and the corresponding references are indicated

Blondel

Multilevel modularity maximization

[27]

CNM

Greedy modularity maximization

[31]

CPM

Multiresolution Potts model

[16]

DM

Spectral analysis + modularity maximization

[33]

EO

Modularity maximization

[28]

HAC

Maximum Likelihood

[43]

Infomap

Information compression

[34]

LPA

Label propagation

[39]

MCL

Simulated flow

[44]

MLGC

Multilevel modularity maximization

[29]

MSG+VM

Greedy modularity maximization + refinement

[30]

RB

Multiresolution Potts model

[35]

RN

Multiresolution Potts model

[36]

RNSC

Neighborhood tabu search

[37]

SAVI

Optimal prediction for random walks

[45]

SCluster

Consensus Hierarchical Clustering + Surprise maximization

[20]

UVCluster

Consensus Hierarchical Clustering + Surprise maximization

[20, 38]

Walktrap

Random walks + modularity maximization

[32]