Improving heuristics for network modularity maximization using an exact algorithm
From MaRDI portal
Publication:406498
DOI10.1016/J.DAM.2012.03.030zbMATH Open1303.90112OpenAlexW2150860159MaRDI QIDQ406498FDOQ406498
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- 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
- Synchronization analysis for complex networks with coupling delay based on TâS fuzzy theory
- Title not available (Why is that?)
- A cutting plane algorithm for a clustering problem
- Facets of the clique partitioning polytope
- Modularity-maximizing graph communities via mathematical programming
- Finding community structures in complex networks using mixed integer optimisation
- A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
Cited In (11)
- Community structure detection for directed networks through modularity optimisation
- Title not available (Why is that?)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Quantum k-community detection: algorithm proposals and cross-architectural evaluation
- Density-based modularity for evaluating community structure in bipartite networks
- Distance geometry and data science
- Efficient modularity density heuristics for large graphs
- Title not available (Why is that?)
- Optimization problems for machine learning: a survey
- Generalized local branching heuristics and the capacitated ring tree problem
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
Uses Software
Recommendations
- A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks 👍 👎
- Title not available (Why is that?) 👍 👎
- Efficient modularity density heuristics for large graphs 👍 👎
- A simple and efficient algorithm for modeling modular complex networks 👍 👎
- Modified modularity density maximization and density ratio heuristic 👍 👎
- Divisive heuristic for modularity density maximization 👍 👎
- Modularity Maximization for Graphons 👍 👎
- Additive Approximation Algorithms for Modularity Maximization 👍 👎
- Additive approximation algorithms for modularity maximization 👍 👎
- Modularity-maximizing graph communities via mathematical programming 👍 👎
This page was built for publication: Improving heuristics for network modularity maximization using an exact algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406498)
