Limited Packing and Multiple Domination problems: Polynomial time reductions

Autores
Leoni, Valeria Alejandra; Nasini, Graciela Leonor
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The Limited Packing and Multiple Domination problems in graphs have closely-related definitions and the same computational complexity on several graph classes. In this work we present two polynomial time reductions between them. Besides, we take into consideration generalized versions of these problems and obtain polynomial time reductions between each one and its generalized version.
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Nasini, Graciela Leonor. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
COMPUTATIONAL COMPLEXITY
K-LIMITED PACKING
K-TUPLE DOMINATING SET
POLYNOMIAL TIME REDUCTIONS
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/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/21872
Acceder
id CONICETDig_19368769827499ddef9c4db10e4b5ff4
oai_identifier_str oai:ri.conicet.gov.ar:11336/21872
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Limited Packing and Multiple Domination problems: Polynomial time reductionsLeoni, Valeria AlejandraNasini, Graciela LeonorCOMPUTATIONAL COMPLEXITYK-LIMITED PACKINGK-TUPLE DOMINATING SETPOLYNOMIAL TIME REDUCTIONShttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1The Limited Packing and Multiple Domination problems in graphs have closely-related definitions and the same computational complexity on several graph classes. In this work we present two polynomial time reductions between them. Besides, we take into consideration generalized versions of these problems and obtain polynomial time reductions between each one and its generalized version.Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Nasini, Graciela Leonor. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaElsevier Science2014-02info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/vnd.rarapplication/pdfhttp://hdl.handle.net/11336/21872Leoni, Valeria Alejandra; Nasini, Graciela Leonor; Limited Packing and Multiple Domination problems: Polynomial time reductions; Elsevier Science; Discrete Applied Mathematics; 164; 2; 2-2014; 547-5530166-218XCONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2013.10.023info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0166218X13004514info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:22:54Zoai:ri.conicet.gov.ar:11336/21872instacron: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-09-29 10:22:54.652CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Limited Packing and Multiple Domination problems: Polynomial time reductions
title Limited Packing and Multiple Domination problems: Polynomial time reductions
spellingShingle Limited Packing and Multiple Domination problems: Polynomial time reductions
Leoni, Valeria Alejandra
COMPUTATIONAL COMPLEXITY
K-LIMITED PACKING
K-TUPLE DOMINATING SET
POLYNOMIAL TIME REDUCTIONS
title_short Limited Packing and Multiple Domination problems: Polynomial time reductions
title_full Limited Packing and Multiple Domination problems: Polynomial time reductions
title_fullStr Limited Packing and Multiple Domination problems: Polynomial time reductions
title_full_unstemmed Limited Packing and Multiple Domination problems: Polynomial time reductions
title_sort Limited Packing and Multiple Domination problems: Polynomial time reductions
dc.creator.none.fl_str_mv Leoni, Valeria Alejandra
Nasini, Graciela Leonor
author Leoni, Valeria Alejandra
author_facet Leoni, Valeria Alejandra
Nasini, Graciela Leonor
author_role author
author2 Nasini, Graciela Leonor
author2_role author
dc.subject.none.fl_str_mv COMPUTATIONAL COMPLEXITY
K-LIMITED PACKING
K-TUPLE DOMINATING SET
POLYNOMIAL TIME REDUCTIONS
topic COMPUTATIONAL COMPLEXITY
K-LIMITED PACKING
K-TUPLE DOMINATING SET
POLYNOMIAL TIME REDUCTIONS
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The Limited Packing and Multiple Domination problems in graphs have closely-related definitions and the same computational complexity on several graph classes. In this work we present two polynomial time reductions between them. Besides, we take into consideration generalized versions of these problems and obtain polynomial time reductions between each one and its generalized version.
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Nasini, Graciela Leonor. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description The Limited Packing and Multiple Domination problems in graphs have closely-related definitions and the same computational complexity on several graph classes. In this work we present two polynomial time reductions between them. Besides, we take into consideration generalized versions of these problems and obtain polynomial time reductions between each one and its generalized version.
publishDate 2014
dc.date.none.fl_str_mv 2014-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/21872
Leoni, Valeria Alejandra; Nasini, Graciela Leonor; Limited Packing and Multiple Domination problems: Polynomial time reductions; Elsevier Science; Discrete Applied Mathematics; 164; 2; 2-2014; 547-553
0166-218X
CONICET Digital
CONICET
url http://hdl.handle.net/11336/21872
identifier_str_mv Leoni, Valeria Alejandra; Nasini, Graciela Leonor; Limited Packing and Multiple Domination problems: Polynomial time reductions; Elsevier Science; Discrete Applied Mathematics; 164; 2; 2-2014; 547-553
0166-218X
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.dam.2013.10.023
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0166218X13004514
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/vnd.rar
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_ 1844614222155087872
score 13.070432

Publicaciones similares