Pages that link to "Item:Q978724"
From MaRDI portal
The following pages link to Finding community structures in complex networks using mixed integer optimisation (Q978724):
Displaying 16 items.
- Community detection by modularity maximization using GRASP with path relinking (Q336716) (← links)
- Divisive heuristic for modularity density maximization (Q342346) (← 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)
- Partition signed social networks via clustering dynamics (Q1619010) (← links)
- Exact computational solution of modularity density maximization by effective column generation (Q1652372) (← links)
- Community structure detection for directed networks through modularity optimisation (Q1736848) (← links)
- A novel mixed integer linear programming model for clustering relational networks (Q1743542) (← 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)
- Maximizing Barber's bipartite modularity is also hard (Q2355315) (← links)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← links)
- A hybrid artificial immune network for detecting communities in complex networks (Q2517303) (← links)
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering (Q5265217) (← links)
- A DC Programming Approach for Finding Communities in Networks (Q5383809) (← links)
