Chapter 3: Classical Algorithms: 3.2 Modularity Based Methods.

The article discusses greedy agglomerative method used by researchers Newman and Girvan for the use of community detection algorithm for computing communities. It uses modularity measure to evaluate community wise partitioning of an input graph. It presents steps for Clauset -Newman-Moore algorithm for community detection. It also discusses Louvain algorithm for community detection which is multi-phase, iterative and produces hierarchy of communities.