Reformulation of a model for hierarchical divisive graph modularity maximization
From MaRDI portal
Publication:490216
DOI10.1007/S10479-012-1286-ZzbMATH Open1303.90111OpenAlexW2024996305MaRDI QIDQ490216FDOQ490216
Authors: Sonia Cafieri, Pierre Hansen, Alberto Costa 
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1286-z
Recommendations
- Divisive heuristic for modularity density maximization
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- A partitioning-based divisive clustering technique for maximizing the modularity
- A cutting plane algorithm for modularity maximization problem
- scientific article; zbMATH DE number 6180551
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Title not available (Why is that?)
- Community structure in social and biological networks
- Collective dynamics of ‘small-world’ networks
- Networks. An introduction.
- Title not available (Why is that?)
- A cutting plane algorithm for a clustering problem
- Linear and quadratic programming approaches for the general graph partitioning problem
- Modularity-maximizing graph communities via mathematical programming
- Finding community structures in complex networks using mixed integer optimisation
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- Compact mathematical formulation for graph partitioning
Cited In (11)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Maximizing Barber's bipartite modularity is also hard
- Efficient modularity density heuristics for large graphs
- Optimization problems for machine learning: a survey
- Modified modularity density maximization and density ratio heuristic
- Additive approximation algorithms for modularity maximization
- Divisive heuristic for modularity density maximization
- Attributed Networks Partitioning Based on Modularity Optimization
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
Uses Software
This page was built for publication: Reformulation of a model for hierarchical divisive graph modularity maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490216)
