Table 8.

Comparisons of computational complexity.

Algorithm	Time Complexity
Fastgreedy	$O\left(nlo{g}^{2}n\right)$
LPA	$O\left(m\right)$
Leading eigenvector	$O\left(n^2\right)$
Walktrap	$O(n^2\ast m)$
NIBLPA	$O\left(m\right)$
EdMot	$O(m^{1.5}+nlogn)$
LPA-MNI	$O(m+nlogn)$