The stable set polytope of quasi-line graphs (Articolo in rivista)

Type
Label
  • The stable set polytope of quasi-line graphs (Articolo in rivista) (literal)
Anno
  • 2008-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/s00493-008-2244-x (literal)
Alternative label
  • Eisenbrand, F.; Oriolo, G.; Stauffer, G.; Ventura, P. (2008)
    The stable set polytope of quasi-line graphs
    in Combinatorica (Print)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Eisenbrand, F.; Oriolo, G.; Stauffer, G.; Ventura, P. (literal)
Pagina inizio
  • 45 (literal)
Pagina fine
  • 67 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.springerlink.com/content/c2hlh34972vv3253/fulltext.pdf (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 28(1) (literal)
Rivista
Note
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Eisenbrand, F.: University of Paderborn, Institute of Mathematics, Warburger Str. 100, Paderborn, 33098, Germany. Oriolo, G.: Universita' di Tor Vergata, Dipartimento di Ingegneria dell'Impresa, Via del Politecnico 1, Roma, 00165, Italy. Stauffer, G.: Ecole Polytechnique Federale de Lausanne, SB-IMA-ROSO Station 8, Lausanne, CH-1015, Switzerland. Ventura, P.: Istituto di Analisi dei Sistemi ed Informatica \"Antonio Ruberti\" del CNR, Viale Manzoni 30, Roma, 00185, Italy. (literal)
Titolo
  • The stable set polytope of quasi-line graphs (literal)
Abstract
  • It is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even no conjecture at hand today. Such a conjecture exists for the class of quasi-line graphs. This class of graphs is a proper superclass of line graphs and a proper subclass of claw-free graphs for which it is known that not all facets have 0/1 normal vectors. The Ben Rebea conjecture states that the stable set polytope of a quasi-line graph is completely described by clique-family inequalities. Chudnovsky and Seymour recently provided a decomposition result for claw-free graphs and proved that the Ben Rebea conjecture holds, if the quasi-line graph is not a fuzzy circular interval graph. In this paper, we give a proof of the Ben Rebea conjecture by showing that it also holds for fuzzy circular interval graphs. Our result builds upon an algorithm of Bartholdi, Orlin and Ratliff which is concerned with integer programs defined by circular ones matrices. (literal)
Prodotto di
Autore CNR

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
data.CNR.it