Reformulation of a model for hierarchical divisive graph modularity maximization
From MaRDI portal
(Redirected from Publication:490216)
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
Cites work
- scientific article; zbMATH DE number 2084315 (Why is no real title available?)
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- A cutting plane algorithm for a clustering problem
- Collective dynamics of `small-world' networks
- Community structure in social and biological networks
- Compact mathematical formulation for graph partitioning
- Finding community structures in complex networks using mixed integer optimisation
- Linear and quadratic programming approaches for the general graph partitioning problem
- Modularity-maximizing graph communities via mathematical programming
- Networks. An introduction.
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
Cited in
(13)- A partitioning-based divisive clustering technique for maximizing the modularity
- 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
- Optimal hierarchical clustering on a graph
- 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
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)
