A Lagrangian Relaxation Algorithm for Modularity Maximization Problem

Kotohumi Inaba (), Yoichi Izunaga () and Yoshitsugu Yamamoto ()
Additional contact information
Kotohumi Inaba: University of Tsukuba
Yoichi Izunaga: University of Tsukuba
Yoshitsugu Yamamoto: University of Tsukuba

A chapter in Operations Research Proceedings 2014, 2016, pp 241-247 from Springer

Abstract: 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.

Keywords: Modularity Maximization Problem; Lagrangian Relaxation Algorithm; Column Generation Technique; Lagrangian Dual Problem; Binary Variable Constraints (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-28697-6_34

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_34

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().