Characterizing N+-perfect line graphs

Autores
Escalante, Mariana Silvina; Nasini, Graciela Leonor; Wagler, Annegret Katrin
Año de publicación
2017
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The aim of this paper is to study the Lovász-Schrijver PSD operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which N+ generates the stable set polytope in one step, called N+ -perfect graphs. It is conjectured that the only N+ -perfect graphs are those whose stable set polytope is described by inequalities with near-bipartite support. So far, this conjecture has been proved for near-perfect graphs, fs-perfect graphs, and webs. Here, we verify it for line graphs, by proving that in an N+ -perfect line graph the only facet-defining subgraphs are cliques and odd holes.
Fil: Escalante, Mariana Silvina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Wagler, Annegret Katrin. Universite Blaise Pascal; Francia. Centre National de la Recherche Scientifique; Francia
Materia
N+-Perfect Graphs
Line Graphs
Psd Relaxation
Stable Set Polytope
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/52511
Acceder
id CONICETDig_250d608e0e8bc399c8a82f9ca346dfbd
oai_identifier_str oai:ri.conicet.gov.ar:11336/52511
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Characterizing N+-perfect line graphsEscalante, Mariana SilvinaNasini, Graciela LeonorWagler, Annegret KatrinN+-Perfect GraphsLine GraphsPsd RelaxationStable Set Polytopehttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1The aim of this paper is to study the Lovász-Schrijver PSD operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which N+ generates the stable set polytope in one step, called N+ -perfect graphs. It is conjectured that the only N+ -perfect graphs are those whose stable set polytope is described by inequalities with near-bipartite support. So far, this conjecture has been proved for near-perfect graphs, fs-perfect graphs, and webs. Here, we verify it for line graphs, by proving that in an N+ -perfect line graph the only facet-defining subgraphs are cliques and odd holes.Fil: Escalante, Mariana Silvina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Wagler, Annegret Katrin. Universite Blaise Pascal; Francia. Centre National de la Recherche Scientifique; FranciaWiley2017-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/52511Escalante, Mariana Silvina; Nasini, Graciela Leonor; Wagler, Annegret Katrin; Characterizing N+-perfect line graphs; Wiley; International Transactions in Operational Research; 24; 1-2; 1-2017; 325-3370969-6016CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1111/itor.12275info:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12275info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-22T11:18:33Zoai:ri.conicet.gov.ar:11336/52511instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-22 11:18:34.261CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Characterizing N+-perfect line graphs
title Characterizing N+-perfect line graphs
spellingShingle Characterizing N+-perfect line graphs
Escalante, Mariana Silvina
N+-Perfect Graphs
Line Graphs
Psd Relaxation
Stable Set Polytope
title_short Characterizing N+-perfect line graphs
title_full Characterizing N+-perfect line graphs
title_fullStr Characterizing N+-perfect line graphs
title_full_unstemmed Characterizing N+-perfect line graphs
title_sort Characterizing N+-perfect line graphs
dc.creator.none.fl_str_mv Escalante, Mariana Silvina
Nasini, Graciela Leonor
Wagler, Annegret Katrin
author Escalante, Mariana Silvina
author_facet Escalante, Mariana Silvina
Nasini, Graciela Leonor
Wagler, Annegret Katrin
author_role author
author2 Nasini, Graciela Leonor
Wagler, Annegret Katrin
author2_role author
author
dc.subject.none.fl_str_mv N+-Perfect Graphs
Line Graphs
Psd Relaxation
Stable Set Polytope
topic N+-Perfect Graphs
Line Graphs
Psd Relaxation
Stable Set Polytope
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The aim of this paper is to study the Lovász-Schrijver PSD operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which N+ generates the stable set polytope in one step, called N+ -perfect graphs. It is conjectured that the only N+ -perfect graphs are those whose stable set polytope is described by inequalities with near-bipartite support. So far, this conjecture has been proved for near-perfect graphs, fs-perfect graphs, and webs. Here, we verify it for line graphs, by proving that in an N+ -perfect line graph the only facet-defining subgraphs are cliques and odd holes.
Fil: Escalante, Mariana Silvina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Wagler, Annegret Katrin. Universite Blaise Pascal; Francia. Centre National de la Recherche Scientifique; Francia
description The aim of this paper is to study the Lovász-Schrijver PSD operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which N+ generates the stable set polytope in one step, called N+ -perfect graphs. It is conjectured that the only N+ -perfect graphs are those whose stable set polytope is described by inequalities with near-bipartite support. So far, this conjecture has been proved for near-perfect graphs, fs-perfect graphs, and webs. Here, we verify it for line graphs, by proving that in an N+ -perfect line graph the only facet-defining subgraphs are cliques and odd holes.
publishDate 2017
dc.date.none.fl_str_mv 2017-01
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/52511
Escalante, Mariana Silvina; Nasini, Graciela Leonor; Wagler, Annegret Katrin; Characterizing N+-perfect line graphs; Wiley; International Transactions in Operational Research; 24; 1-2; 1-2017; 325-337
0969-6016
CONICET Digital
CONICET
url http://hdl.handle.net/11336/52511
identifier_str_mv Escalante, Mariana Silvina; Nasini, Graciela Leonor; Wagler, Annegret Katrin; Characterizing N+-perfect line graphs; Wiley; International Transactions in Operational Research; 24; 1-2; 1-2017; 325-337
0969-6016
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1111/itor.12275
info:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12275
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Wiley
publisher.none.fl_str_mv Wiley
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846781650451562496
score 12.982451

Publicaciones similares