Community detection by modularity maximization using GRASP with path relinking

DOI10.1016/j.cor.2013.03.002zbMath1348.91237OpenAlexW2162802226MaRDI QIDQ336716

Mariá C. V. Nascimento, Leonidas S. 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

complex systemsmodularitypath relinkingcommunity structuregraspgraph clustering

Mathematics Subject Classification ID

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

Related Items

Intelligent-guided adaptive search for the maximum covering location problem, Exact computational solution of modularity density maximization by effective column generation, Divisive heuristic for modularity density maximization, Social structure optimization in team formation, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, Graph clustering with Boltzmann machines, A DC Programming Approach for Finding Communities in Networks, Graph Clustering Via Intra-Cluster Density Maximization, Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization, Efficient modularity density heuristics for large graphs, Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks, Some properties of e-quality function for network clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modularity-maximizing graph communities via mathematical programming
• Finding community structures in complex networks using mixed integer optimisation
• Investigation of a new GRASP-based clustering algorithm applied to biological data
• GRASP with path relinking for the weighted MAXSAT problem
• Communities in Networks
• An Efficient Heuristic Procedure for Partitioning Graphs
• Community structure in social and biological networks
• A GRASP with path-relinking for private virtual circuit routing
• Fast unfolding of communities in large networks
• Collective dynamics of ‘small-world’ networks
• Benchmarking optimization software with performance profiles.