The following pages link to (Q5298937):
Displaying 20 items.
- Community detection by modularity maximization using GRASP with path relinking (Q336716) (← links)
- Improving heuristics for network modularity maximization using an exact algorithm (Q406498) (← links)
- Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
- Modularity-maximizing graph communities via mathematical programming (Q977873) (← links)
- Exact computational solution of modularity density maximization by effective column generation (Q1652372) (← links)
- Graph clustering based on modularity variation estimations (Q1717412) (← links)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
- Efficient modularity density heuristics for large graphs (Q1751717) (← links)
- Modified modularity density maximization and density ratio heuristic (Q2108173) (← links)
- Distance geometry and data science (Q2192022) (← links)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← 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)
- Search for MC in modified networks (Q5926035) (← links)
- Exponential quality function for community detection in complex networks (Q6088242) (← links)
- Variable neighborhood search approach to community detection problem (Q6097202) (← links)
- Maximum modular graphs (Q6135108) (← links)
- Graph clustering with Boltzmann machines (Q6140246) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)
