Name of Method | Equation # | Computational complexity | Reference |
---|
Girvan Newman | 1 | O(m2n) | [1, 7] |
Fast Greedy | 2, 3, 4 | O(nlog2n) | [11] |
Combo | 1 | O(n2logc) | [28] |
Louvain | 1, 5 | O(nlogn) | [10] |
Conclude | 6, 7 | O(m) | [29] |
Infomap | 8 | O(m) | [30] |
Leading Eigen | 9, 10, 12 | O(n2) | [8] |
Spinglass | 15 | O(n3.2) | [9] |