8 citations · 8 across the 1 of their papers we have counts for
1 paper
Andreas Noack, Randolf Rotta
Modularity is one of the most widely used quality measures for graph clusterings. Maximizing modularity is NP-hard, and the runtime of exact algorithms is prohibitive for large gra…