Pages that link to "Item:Q490216"
From MaRDI portal
The following pages link to Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216):
Displaying 10 items.
- Divisive heuristic for modularity density maximization (Q342346) (← links)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
- Efficient modularity density heuristics for large graphs (Q1751717) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- Modified modularity density maximization and density ratio heuristic (Q2108173) (← links)
- Additive approximation algorithms for modularity maximization (Q2221809) (← links)
- Maximizing Barber's bipartite modularity is also hard (Q2355315) (← links)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← links)
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering (Q5265217) (← links)
- A study on modularity density maximization: column generation acceleration and computational complexity analysis (Q6112587) (← links)
