NOESIS: A Framework for Complex Network Data Analysis

Table 2

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

Type	Name	Complexity	Reference
Hierarchical	Single link (SLINK)		[45]
	Complete link (CLINK)		[46]
	Average link (UPGMA)		[47]
Modularity	Fast greedy		[48]
	Multistep greedy		[49]
Partitional	Kernighan–Lin bipartitioning		[50]
	K-means		[51]
Spectral	Ratio cut (EIG1)		[52]
	Jordan–Weiss NG (KNSC1)		[53]
	Spectral K-means		[54]
Overlapping	BigClam		[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.