Skip to Main content Skip to Navigation
Conference papers

Algorithms for network modularity maximization

Abstract : Networks are often used to represent complex systems arising in a variety of fields. Social networks model interactions among people. Telecommunication networks model communications betwen them, such as in the WorldWide Web. Transportation networks model movements of goods and passengers. Biological networks model interactions between organisms, such as in food networks. A network (or graph) G = (V,E) is composed of a set of vertices, representing the entities of the system under study, and a set of edges joining pairs of vertices and representing a relation holding for such pairs. Identifying communities, or clusters, in complex networks is a topic of particular interest and is currently a very active research domain.
Document type :
Conference papers
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Tuesday, April 15, 2014 - 2:24:25 PM
Last modification on : Tuesday, October 19, 2021 - 11:02:49 AM
Long-term archiving on: : Tuesday, July 15, 2014 - 10:37:21 AM


Files produced by the author(s)


  • HAL Id : hal-00934772, version 1



Daniel Aloise, Sonia Cafieri, Gilles Caporossi, Pierre Hansen, Leo Liberti, et al.. Algorithms for network modularity maximization. ROADEF 2010, 11ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2010, Toulouse, France. ⟨hal-00934772⟩



Les métriques sont temporairement indisponibles