Community detection by modularity maximization using GRASP with path relinking
DOI10.1016/J.COR.2013.03.002zbMATH Open1348.91237OpenAlexW2162802226MaRDI QIDQ336716FDOQ336716
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
Recommendations
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)
Cites Work
- Benchmarking optimization software with performance profiles.
- An Efficient Heuristic Procedure for Partitioning Graphs
- Community structure in social and biological networks
- Fast unfolding of communities in large networks
- Collective dynamics of `small-world' networks
- Title not available (Why is that?)
- GRASP: An annoted bibliography
- Title not available (Why is that?)
- Investigation of a new GRASP-based clustering algorithm applied to biological data
- GRASP with path relinking for the weighted MAXSAT problem
- Communities in Networks
- A GRASP with path-relinking for private virtual circuit routing
- Modularity-maximizing graph communities via mathematical programming
- Finding community structures in complex networks using mixed integer optimisation
Cited In (18)
- Graph clustering with Boltzmann machines
- Title not available (Why is that?)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- A DC Programming Approach for Finding Communities in Networks
- Variable neighborhood search approach to community detection problem
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- A Lagrangian relaxation algorithm for modularity maximization problem
- Efficient modularity density heuristics for large graphs
- Graph clustering via intra-cluster density maximization
- Some properties of E-quality function for network clustering
- Intelligent-guided adaptive search for the maximum covering location problem
- Exact computational solution of modularity density maximization by effective column generation
- Min-max communities in graphs: complexity and computational properties
- 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
- Toward optimal community detection: from trees to general weighted networks
- The maximum community partition problem 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)
