Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2020-04-29T14:55:12Z
dc.date.available 2020-04-29T14:55:12Z
dc.date.issued 2013
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/94544
dc.description.abstract 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. en
dc.format.extent 3 es
dc.language en es
dc.subject K-domination in graphs es
dc.subject NP-hard es
dc.subject Graphs es
dc.title Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs en
dc.type Objeto de conferencia es
sedici.identifier.issn 1850-2865 es
sedici.creator.person Argiroffo, G. es
sedici.creator.person Escalante, M. es
sedici.creator.person Ugarte, M. E. es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Sociedad Argentina de Informática e Investigación Operativa es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.date.exposure 2013-09
sedici.relation.event XI Simposio Argentino de Investigación Operativa (SIO) - JAIIO 42 (2013) es
sedici.description.peerReview peer-review es
sedici.description.resumen true es


Download Files

Thumbnail
Resumen
Download file (169.4Kb) - PDF

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)