Pages that link to "Item:Q5084675"
From MaRDI portal
The following pages link to The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675):
Displaying 4 items.
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
