Modularity proposed by Newman and Girvan is the most commonly used measure when the nodes of a graph are grouped into communities consisting of tightly connected nodes. We formulate the modularity maximization problem as a set partitioning problem, and propose an algorithm for the problem based on the linear programming relaxation. We solve the dual of the linear programming relaxation by using a cutting plane method. To mediate the slow convergence that cutting plane methods usually suffer, we propose a method for finding and simultaneously adding multiple cutting planes.
|Number of pages||19|
|Journal||Journal of the Operations Research Society of Japan|
|Publication status||Published - Mar 2017|
All Science Journal Classification (ASJC) codes
- Decision Sciences(all)
- Management Science and Operations Research