Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs

dc.creatorArgiroffo, G.
dc.creatorEscalante, M.
dc.creatorUgarte, M. E.
dc.date2013-09
dc.date2013
dc.date2020-04-29T14:55:12Z
dc.date.accessioned2023-07-14T19:33:10Z
dc.date.available2023-07-14T19:33:10Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/94544
dc.identifierissn:1850-2865
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7435754
dc.descriptionDomination 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.descriptionSociedad Argentina de Informática e Investigación Operativa
dc.formatapplication/pdf
dc.format3
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectCiencias Informáticas
dc.subjectK-domination in graphs
dc.subjectNP-hard
dc.subjectGraphs
dc.titlePolyhedral study of the 2-dominating set polytope of cycles and cactus graphs
dc.typeObjeto de conferencia
dc.typeResumen


Este ítem pertenece a la siguiente institución