Improving heuristics for network modularity maximization using an exact algorithm

DOI10.1016/j.dam.2012.03.030zbMath1303.90112OpenAlexW2150860159MaRDI QIDQ406498

Pierre Hansen, Sonia Cafieri, Leo Liberti

Publication date: 8 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.030

zbMATH Keywords

networkgraphclusteringheuristicexact algorithmmodularitybipartitionmatheuristiccommunity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Distance geometry and data science, Quantum k-community detection: algorithm proposals and cross-architectural evaluation, Community structure detection for directed networks through modularity optimisation, Generalized local branching heuristics and the capacitated ring tree problem, Density-based modularity for evaluating community structure in bipartite networks, Efficient modularity density heuristics for large graphs, Optimization problems for machine learning: a survey, Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering

Uses Software

• GraphBase
• CPLEX

Cites Work

• Unnamed Item
• Synchronization analysis for complex networks with coupling delay based on TâS fuzzy theory
• Facets of the clique partitioning polytope
• Modularity-maximizing graph communities via mathematical programming
• Finding community structures in complex networks using mixed integer optimisation
• A cutting plane algorithm for a clustering problem
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Collective dynamics of ‘small-world’ networks