Composition of stable set polyhedra

Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph minus an edge and use the new theorem to derive a class of facets.

• Type: Journal
• Year: 2008
• Where: ORL
• Authors: Benjamin McClosky, Illya V. Hicks
• Keywords: Cardinality, Complete Graph, ORL 2008, Stable Set Polytope