Skip to Main content Skip to Navigation
Conference papers

Reformulation of a locally optimal heuristic for modularity maximization

Abstract : A network, or graph, G = (V,E) consists of a set of vertices V = {1, . . . , n} and a set of edges E = {1, . . . ,m} connecting vertices. One of the most studied problems in the field of complex systems is to find communities, or clusters, in networks. A community consists of a subset S of the vertices of V where inner edges connecting pairs of vertices of S are more dense than cut edges connecting vertices of S to vertices of V \S. Many criteria have been proposed to evaluate partitions of V into communities.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Tuesday, April 8, 2014 - 4:06:13 PM
Last modification on : Tuesday, October 19, 2021 - 11:02:48 AM
Long-term archiving on: : Tuesday, July 8, 2014 - 10:43:37 AM


Files produced by the author(s)


  • HAL Id : hal-00934798, version 1



Alberto Costa, Sonia Cafieri, Pierre Hansen. Reformulation of a locally optimal heuristic for modularity maximization. ROADEF 2012, 13ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Apr 2012, Angers, France. ⟨hal-00934798⟩



Record views


Files downloads