dc.creator | Argiroffo, G. | |
dc.creator | Escalante, M. | |
dc.creator | Ugarte, M. E. | |
dc.date | 2013-09 | |
dc.date | 2013 | |
dc.date | 2020-04-29T14:55:12Z | |
dc.date.accessioned | 2023-07-14T19:33:10Z | |
dc.date.available | 2023-07-14T19:33:10Z | |
dc.identifier | http://sedici.unlp.edu.ar/handle/10915/94544 | |
dc.identifier | issn:1850-2865 | |
dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7435754 | |
dc.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. | |
dc.description | Sociedad Argentina de Informática e Investigación Operativa | |
dc.format | application/pdf | |
dc.format | 3 | |
dc.language | en | |
dc.rights | http://creativecommons.org/licenses/by-nc-sa/4.0/ | |
dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) | |
dc.subject | Ciencias Informáticas | |
dc.subject | K-domination in graphs | |
dc.subject | NP-hard | |
dc.subject | Graphs | |
dc.title | Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs | |
dc.type | Objeto de conferencia | |
dc.type | Resumen | |