Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs
- Autores
- Argiroffo, G.; Escalante, M.; Ugarte, M. E.
- Año de publicación
- 2013
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- Domination and its variations arise in many applications, in particular in those involving strategic placement of items at vertices of a network. For general graphs these problems are NP-hard, however, domination in graphs has been shown to be polynomially solvable in several graph classes. In this work we consider a generalization of this problem called k-domination in graphs.
Sociedad Argentina de Informática e Investigación Operativa - Materia
-
Ciencias Informáticas
K-domination in graphs
NP-hard
Graphs - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/4.0/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/94544
Ver los metadatos del registro completo
id |
SEDICI_1ec5c5a9d99609a5b4b40268e6b41c84 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/94544 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphsArgiroffo, G.Escalante, M.Ugarte, M. E.Ciencias InformáticasK-domination in graphsNP-hardGraphsDomination and its variations arise in many applications, in particular in those involving strategic placement of items at vertices of a network. For general graphs these problems are NP-hard, however, domination in graphs has been shown to be polynomially solvable in several graph classes. In this work we consider a generalization of this problem called k-domination in graphs.Sociedad Argentina de Informática e Investigación Operativa2013-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionResumenhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf3http://sedici.unlp.edu.ar/handle/10915/94544enginfo:eu-repo/semantics/altIdentifier/issn/1850-2865info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:19:42Zoai:sedici.unlp.edu.ar:10915/94544Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:19:42.567SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs |
title |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs |
spellingShingle |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs Argiroffo, G. Ciencias Informáticas K-domination in graphs NP-hard Graphs |
title_short |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs |
title_full |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs |
title_fullStr |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs |
title_full_unstemmed |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs |
title_sort |
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs |
dc.creator.none.fl_str_mv |
Argiroffo, G. Escalante, M. Ugarte, M. E. |
author |
Argiroffo, G. |
author_facet |
Argiroffo, G. Escalante, M. Ugarte, M. E. |
author_role |
author |
author2 |
Escalante, M. Ugarte, M. E. |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas K-domination in graphs NP-hard Graphs |
topic |
Ciencias Informáticas K-domination in graphs NP-hard Graphs |
dc.description.none.fl_txt_mv |
Domination and its variations arise in many applications, in particular in those involving strategic placement of items at vertices of a network. For general graphs these problems are NP-hard, however, domination in graphs has been shown to be polynomially solvable in several graph classes. In this work we consider a generalization of this problem called k-domination in graphs. Sociedad Argentina de Informática e Investigación Operativa |
description |
Domination and its variations arise in many applications, in particular in those involving strategic placement of items at vertices of a network. For general graphs these problems are NP-hard, however, domination in graphs has been shown to be polynomially solvable in several graph classes. In this work we consider a generalization of this problem called k-domination in graphs. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-09 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Resumen http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/94544 |
url |
http://sedici.unlp.edu.ar/handle/10915/94544 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/issn/1850-2865 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
dc.format.none.fl_str_mv |
application/pdf 3 |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1844616071128023040 |
score |
13.070432 |