Pages that link to "Item:Q2967612"
From MaRDI portal
The following pages link to An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612):
Displaying 4 items.
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
