• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Composition of graphs and polyhedra II : Stable Sets

Thumbnail
Date
1994
Dewey
Principes généraux des mathématiques
Sujet
compact systems; stable set polytope; composition of polyhedra; polyhedral combinatorics
Journal issue
SIAM Journal on Discrete Mathematics
Volume
7
Number
3
Publication date
1994
Article pages
359-371
Publisher
Society for Industrial and Applied Mathematics
DOI
http://dx.doi.org/10.1137/S0895480190182678
URI
https://basepub.dauphine.fr/handle/123456789/2805
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Barahona, Francisco
Mahjoub, Ali Ridha
Type
Article accepté pour publication ou publié
Abstract (EN)
A graph $G$ with a two-node cutset decomposes into two pieces. A technique to describe the stable set polytope for $G$ based on stable set polytopes associated with the pieces is studied. This gives a way to characterize this polytope for classes of graphs that can be recursively decomposed. This also gives a procedure to describe new facets of this polytope. A compact system for the stable set problem in series-parallel graphs is derived. This technique is also applied to characterize facet-defining inequalities for graphs with no $K_5 \backslash e$ minor. The stable set problem is polynomially solvable for this class of graphs. Compositions of $h$-perfect graphs are also studied

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.