Sciweavers

MP
2010
149views more  MP 2010»
13 years 11 months ago
Copositive programming motivated bounds on the stability and the chromatic numbers
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
Igor Dukanovic, Franz Rendl