www-ai.cs.tu-dortmund.de/de/LEHRE/SEMINARE/SS09/AKTARBEITENDESDM/LITERATUR/OverlappingCommunities.pdf
LNAI 5211 - A Fast Algorithm to Find Overlapping Communities in Networks
except for very small networks, because these contain very few communities.
0
0.2
0.4
0.6
0.8
1
1.2 1.5 1.8 2.1 2.4 2.7 3 3.3 3.6 Average number of communities per vertex (r)
CONGO: h=2 h=3
CONGA CFinder: [...] network into {1,2,3} and {1,2,3,4,5,6} seems meaningless, but if vertices 1, 2, and 3 belong more strongly to the first cluster than the second, the solution is more like two clusters {1,2,3} and {4,5 [...] its time complexity as follows.
For step 1, the time complexity for h=" is O(mn); this would reduce to O(m) for h=1, which is of no practical use because the 1-betweenness of every edge is the same. For …
