|Subject:||Re: [igraph] Another fast community detection algorithm|
|Date:||Tue, 29 Apr 2008 17:05:10 +0200|
I have been using another fast community detection algorithm. It produces more balanced clusters than the fast-greedy one.Thanks, it's already on our todo list. You might also be interested in the paper of Danon et al (arXiv:physics/0601144v1), they proposed a similar modification to the original greedy modularity algorithm. I will add these heuristics sooner or later to igraph, but I doubt they will be added before 0.6 due to lack of time.
|[Prev in Thread]||Current Thread||[Next in Thread]|