A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM

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 t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the Operations Research Society of Japan 2017, Vol.60(1), pp.24-42
Hauptverfasser:	Izunaga, Yoichi, Yamamoto, Yoshitsugu
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Combinatorial optimization community detection cutting planes Cutting speed Linear programming Mathematical problems Maximization Modularity modularity maximization Nodes Optimization set partitioning Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!