Network Clustering via Maximizing Modularity: Approximation Algorithms and Theoretical Limits
Network Clustering via Maximizing Modularity: Approximation Algorithms and Theoretical Limits
Many social networks and complex systems are found to be naturally divided into clusters of densely connected nodes, known as community structure (CS). Finding CS is one of fundamental yet challenging topics in network science. One of the most popular classes of methods for this problem is to maximize Newman's …