著者

IZUNAGA Yoichi YAMAMOTO Yoshitsugu

出版者

University of Tsukuba. Graduate School of Systems and Information Engineering. Doctoral Program in Social Systems & Management

巻号頁・発行日

2013-07

---

The 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 connectednodes. 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 which may complement well each other.