Pages that link to "Item:Q2054100"
From MaRDI portal
The following pages link to Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100):
Displaying 4 items.
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Iterated multilevel simulated annealing for large-scale graph conductance minimization (Q6071282) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
- Efficient game theoretic approach to dynamic graph partitioning (Q6191175) (← links)
