A cutting plane algorithm for modularity maximization problem
From MaRDI portal
Publication:5267565
Recommendations
- Modularity-maximizing graph communities via mathematical programming
- A Lagrangian relaxation algorithm for modularity maximization problem
- scientific article; zbMATH DE number 3991298
- Toward optimal community detection: from trees to general weighted networks
- On Finding Graph Clusterings with Maximum Modularity
Cited in
(12)- Additive approximation algorithms for modularity maximization
- Searching graph communities by modularity maximization via convex optimization
- Using graph partitioning for efficient network modularity optimization
- Reformulation of a model for hierarchical divisive graph modularity maximization
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
- Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks
- A Lagrangian relaxation algorithm for modularity maximization problem
- Modularity-maximizing graph communities via mathematical programming
- scientific article; zbMATH DE number 3991298 (Why is no real title available?)
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- Toward optimal community detection: from trees to general weighted networks
- Additive approximation algorithms for modularity maximization
This page was built for publication: A cutting plane algorithm for modularity maximization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267565)