Improving heuristics for network modularity maximization using an exact algorithm
From MaRDI portal
Publication:406498
Recommendations
- A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
- scientific article; zbMATH DE number 6180551
- 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
Cites work
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
- A cutting plane algorithm for a clustering problem
- Collective dynamics of `small-world' networks
- Community structure in social and biological networks
- Facets of the clique partitioning polytope
- Fast unfolding of communities in large networks
- Finding community structures in complex networks using mixed integer optimisation
- Modularity-maximizing graph communities via mathematical programming
- Synchronization analysis for complex networks with coupling delay based on TâS fuzzy theory
- The Structure and Function of Complex Networks
Cited in
(11)- Community structure detection for directed networks through modularity optimisation
- scientific article; zbMATH DE number 6180551 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 5630701 (Why is no real title available?)
- 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
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)
