A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games

Autores
Dobson, Maria Patricia; Leoni, Valeria Alejandra; Nasini, Graciela Leonor
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the polynomiality for the covering case. In addition, we solve the computational complexity of universally balanced (with respect to the resources constraints) packing games.
Fil: Dobson, Maria Patricia. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Materia
Edge-Perfect
Graph
Np-Completeness
Totally Balanced Game
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/79345
Acceder
id CONICETDig_eb8f06428b076c08f682da0b6bf68b3c
oai_identifier_str oai:ri.conicet.gov.ar:11336/79345
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization gamesDobson, Maria PatriciaLeoni, Valeria AlejandraNasini, Graciela LeonorEdge-PerfectGraphNp-CompletenessTotally Balanced Gamehttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the polynomiality for the covering case. In addition, we solve the computational complexity of universally balanced (with respect to the resources constraints) packing games.Fil: Dobson, Maria Patricia. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaElsevier Science2013-02info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/79345Dobson, Maria Patricia; Leoni, Valeria Alejandra; Nasini, Graciela Leonor; A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games; Elsevier Science; Discrete Optimization; 10; 1; 2-2013; 54-601572-5286CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.disopt.2012.10.004info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1572528612000722info: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:40:05Zoai:ri.conicet.gov.ar:11336/79345instacron: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:40:05.34CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
title A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
spellingShingle A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
Dobson, Maria Patricia
Edge-Perfect
Graph
Np-Completeness
Totally Balanced Game
title_short A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
title_full A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
title_fullStr A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
title_full_unstemmed A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
title_sort A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
dc.creator.none.fl_str_mv Dobson, Maria Patricia
Leoni, Valeria Alejandra
Nasini, Graciela Leonor
author Dobson, Maria Patricia
author_facet Dobson, Maria Patricia
Leoni, Valeria Alejandra
Nasini, Graciela Leonor
author_role author
author2 Leoni, Valeria Alejandra
Nasini, Graciela Leonor
author2_role author
author
dc.subject.none.fl_str_mv Edge-Perfect
Graph
Np-Completeness
Totally Balanced Game
topic Edge-Perfect
Graph
Np-Completeness
Totally Balanced Game
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the polynomiality for the covering case. In addition, we solve the computational complexity of universally balanced (with respect to the resources constraints) packing games.
Fil: Dobson, Maria Patricia. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
description We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the polynomiality for the covering case. In addition, we solve the computational complexity of universally balanced (with respect to the resources constraints) packing games.
publishDate 2013
dc.date.none.fl_str_mv 2013-02
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/79345
Dobson, Maria Patricia; Leoni, Valeria Alejandra; Nasini, Graciela Leonor; A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games; Elsevier Science; Discrete Optimization; 10; 1; 2-2013; 54-60
1572-5286
CONICET Digital
CONICET
url http://hdl.handle.net/11336/79345
identifier_str_mv Dobson, Maria Patricia; Leoni, Valeria Alejandra; Nasini, Graciela Leonor; A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games; Elsevier Science; Discrete Optimization; 10; 1; 2-2013; 54-60
1572-5286
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.1016/j.disopt.2012.10.004
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1572528612000722
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
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
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_ 1846782069984722944
score 12.982451

Publicaciones similares