LPAm+
From MaRDI portal
Cited in
(9)- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- Efficient modularity density heuristics for large graphs
- Graph clustering via intra-cluster density maximization
- Exact computational solution of modularity density maximization by effective column generation
- VNDS
- A Statistical Performance Analysis of Graph Clustering Algorithms
- Python-Louvain
- scientific article; zbMATH DE number 6180551 (Why is no real title available?)
- Memetic graph clustering
This page was built for software: LPAm+
