Abstract
Modularity proposed by Newman and Girvan is one of the most common 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 based on the Lagrangian relaxation. To alleviate the computational burden, we use the column generation technique.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Liberti, L., Pellon, S.: Column generation algorithms for exact modularity maximization in networks. Phys. Rev. E 82 (2012)
Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20, 172–188 (2008)
Boschetti, M., Minggozzi, A., Ricciardelli, S.: A dual ascent procedure for the set partitioning problem. Discrete Optim. 5, 735–747 (2008)
du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. Discrete Math. 194, 229–237 (1999)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69 (2004)
Xu, G., Tsoka, S., Papageorgiou, L.: Finding community structures in complex networks using mixed integer optimization. Eur. Phys. J. B 50, 231–239 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Inaba, K., Izunaga, Y., Yamamoto, Y. (2016). A Lagrangian Relaxation Algorithm for Modularity Maximization Problem. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-28697-6_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28695-2
Online ISBN: 978-3-319-28697-6
eBook Packages: Business and ManagementBusiness and Management (R0)