Table 2: Computational time complexity and bibliographic references for the community detection techniques provided by NOESIS.

TypeNameComplexityReference

HierarchicalSingle link (SLINK)[45]
Complete link (CLINK)[46]
Average link (UPGMA)[47]

ModularityFast greedy[48]
Multistep greedy[49]

PartitionalKernighan–Lin bipartitioning[50]
K-means[51]

SpectralRatio cut (EIG1)[52]
Jordan–Weiss NG (KNSC1)[53]
Spectral K-means[54]

OverlappingBigClam[55]

In the time complexity analysis, is the number of nodes in the network, d is the maximum node degree, and k is the desired number of clusters.