Pages that link to "Item:Q977873"
From MaRDI portal
The following pages link to Modularity-maximizing graph communities via mathematical programming (Q977873):
Displaying 7 items.
- A note on graphs whose largest eigenvalues of the modularity matrix equals zero (Q5501692) (← links)
- Modularity based community detection in hypergraphs (Q6057290) (← links)
- Optimizing edge sets in networks to produce ground truth communities based on modularity (Q6066243) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)
- A study on modularity density maximization: column generation acceleration and computational complexity analysis (Q6112587) (← links)
- Maximum modular graphs (Q6135108) (← links)
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks (Q6565391) (← links)