The following pages link to (Q5298937):
Displaying 10 items.
- Exact computational solution of modularity density maximization by effective column generation (Q1652372) (← links)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
- Efficient modularity density heuristics for large graphs (Q1751717) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Graph Clustering Via Intra-Cluster Density Maximization (Q3294900) (← links)
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering (Q5265217) (← links)
- A Statistical Performance Analysis of Graph Clustering Algorithms (Q5881233) (← links)
- Exponential quality function for community detection in complex networks (Q6088242) (← links)
- Graph clustering with Boltzmann machines (Q6140246) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)
