Community detection by modularity maximization using GRASP with path relinking

DOI10.1016/J.COR.2013.03.002MaRDI QIDQ336716zbMATH OpenOpenAlexFDO

Authors Mariá C. V. Nascimento, Leonidas Pitsoulis

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.03.002

zbMATH Keywords

graph clusteringmodularitycomplex systemsgrasppath relinkingcommunity structure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Recommendations

• scientific article; zbMATH DE number 6180551
• On Finding Graph Clusterings with Maximum Modularity
• Toward optimal community detection: from trees to general weighted networks
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• Maximum modular graphs

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• A GRASP with path-relinking for private virtual circuit routing
• An Efficient Heuristic Procedure for Partitioning Graphs
• Benchmarking optimization software with performance profiles.
• Collective dynamics of `small-world' networks
• Communities in Networks
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Finding community structures in complex networks using mixed integer optimisation
• GRASP with path relinking for the weighted MAXSAT problem
• GRASP: An annoted bibliography
• Investigation of a new GRASP-based clustering algorithm applied to biological data
• Modularity-maximizing graph communities via mathematical programming

Cited in

(18)

• scientific article; zbMATH DE number 6611472 (Why is no real title available?)
• Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
• Divisive heuristic for modularity density maximization
• Social structure optimization in team formation
• Efficient modularity density heuristics for large graphs
• Variable neighborhood search approach to community detection problem
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• A Lagrangian relaxation algorithm for modularity maximization problem
• Graph clustering via intra-cluster density maximization
• Intelligent-guided adaptive search for the maximum covering location problem
• Exact computational solution of modularity density maximization by effective column generation
• Some properties of E-quality function for network clustering
• Min-max communities in graphs: complexity and computational properties
• Graph clustering with Boltzmann machines
• Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
• The maximum community partition problem in networks
• Toward optimal community detection: from trees to general weighted networks
• A DC Programming Approach for Finding Communities in Networks

This page was built for publication: Community detection by modularity maximization using GRASP with path relinking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336716)