Pages that link to "Item:Q2467349"
From MaRDI portal
The following pages link to A semidefinite programming-based heuristic for graph coloring (Q2467349):
Displaying 4 items.
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
