Skip to main content
SpringerLink
Log in

A Lagrangian Relaxation Algorithm for Modularity Maximization Problem

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

Part of the book series: Operations Research Proceedings ((ORP))

  • 1842 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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)

    Google Scholar 

  2. 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)

    Article  Google Scholar 

  3. Boschetti, M., Minggozzi, A., Ricciardelli, S.: A dual ascent procedure for the set partitioning problem. Discrete Optim. 5, 735–747 (2008)

    Article  Google Scholar 

  4. du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. Discrete Math. 194, 229–237 (1999)

    Article  Google Scholar 

  5. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69 (2004)

    Google Scholar 

  6. Xu, G., Tsoka, S., Papageorgiou, L.: Finding community structures in complex networks using mixed integer optimization. Eur. Phys. J. B 50, 231–239 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Tsukuba, Ibaraki, 305-8573, Japan

    Kotohumi Inaba, Yoichi Izunaga & Yoshitsugu Yamamoto

Authors
  1. Kotohumi Inaba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoichi Izunaga
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yoshitsugu Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yoichi Izunaga .

Editor information

Editors and Affiliations

  1. Operations Research, RWTH Aachen University, Aachen, Germany

    Marco Lübbecke

  2. Lehrstuhl II für Mathematik, RWTH Aachen University, Aachen, Germany

    Arie Koster

  3. RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Peter Letmathe

  4. E.ON Energy Research Center, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Reinhard Madlener

  5. Management Science, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Britta Peis

  6. Chair of Operations Management, RWTH Aachen University, Aachen, Germany

    Grit Walther

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation