Login / Signup

Exploring the Relationship Between Max-Cut and Stable Set Relaxations.

Monia GiandomenicoAdam N. Letchford
Published in: Math. Program. (2006)
Keyphrases
  • stable set
  • max cut
  • np hard
  • graph model
  • planar graphs
  • lower bound
  • np complete problems
  • linear programming
  • spectral graph
  • graph partitioning
  • np complete
  • image segmentation
  • pairwise
  • special case
  • scheduling problem