Some properties of e-quality function for network clustering
From MaRDI portal
Publication:3388944
DOI10.2298/YJOR191215031DzbMath1474.90081OpenAlexW3094858377MaRDI QIDQ3388944
Publication date: 7 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/yjor191215031d
Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Cites Work
- Community detection by modularity maximization using GRASP with path relinking
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- On Finding Graph Clusterings with Maximum Modularity
- Memetic Graph Clustering
- Fast unfolding of communities in large networks
- Exponential quality function for community detection in complex networks
This page was built for publication: Some properties of e-quality function for network clustering