Composition of stable set polyhedra

12 years 3 months ago

Download www.caam.rice.edu

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.

Benjamin McClosky, Illya V. Hicks

Real-time Traffic

Cardinality | Complete Graph | ORL 2008 | Stable Set Polytope |

claim paper

» Interprocedurally Analysing Linear Inequality Relations

» Branched Polyhedral Systems

» The Graphs with All Subgraphs TPerfect

» USPEX Evolutionary crystal structure prediction

» A Maximum Entropy Framework for PartBased Texture and Object Recognition

» Bundle Event Structures and CCSP

» A Discriminative Framework for Texture and Object Recognition Using Local Image Features

» TemplateIndependent News Extraction Based on Visual Consistency

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	ORL
Authors	Benjamin McClosky, Illya V. Hicks

Comments (0)

Sciweavers

Composition of stable set polyhedra

Cardinality | Complete Graph | ORL 2008 | Stable Set Polytope |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers