The following pages link to Maximum modular graphs (Q6135108):
Displaying 12 items.
- Community detection by modularity maximization using GRASP with path relinking (Q336716) (← links)
- The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
- New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) (Q2068829) (← links)
- Spectrum of Johnson graphs (Q2111919) (← links)
- Exact modularity of line graphs of complete graphs (Q2229338) (← links)
- Maximizing Barber's bipartite modularity is also hard (Q2355315) (← links)
- The maximum community partition problem in networks (Q2874043) (← links)
- On Finding Graph Clusterings with Maximum Modularity (Q3508560) (← links)
- (Q4993553) (← links)
- A note on graphs whose largest eigenvalues of the modularity matrix equals zero (Q5501692) (← links)
- Modularity Maximization for Graphons (Q6038778) (← links)
- Modularity of minor‐free graphs (Q6094045) (← links)