Generalized limited packings of some graphs with a limited number of P4-partners
- Autores
- Dobson, M. P.; Hinrichsen, E.; Leoni, Valeria Alejandra
- Año de publicación
- 2015
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- By using modular decomposition and handling certain graph operations such as join and union, we show that the Generalized Limited Packing Problem—NP-complete in general—can be solved in polynomial time in some graph classes with a limited number of P4-partners; specifically P4-tidy graphs, which contain cographs and P4-sparse graphs. In particular, we describe an algorithm to compute the associated numbers in polynomial time within these graph classes. In this way, we generalize some of the previous results on the subject. We also make some progress on the study of the computational complexity of the Generalized Multiple Domination Problem in graphs.
Fil: Dobson, M. P.. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; Argentina
Fil: Hinrichsen, E.. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; Argentina
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Cientifico Tecnológico Rosario; Argentina - Materia
-
Generalized Limited Packing
Join
Union
P4-Partners - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/13338
Ver los metadatos del registro completo
id |
CONICETDig_0ff71cd84c7b04fd0cded3890617785e |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/13338 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Generalized limited packings of some graphs with a limited number of P4-partnersDobson, M. P.Hinrichsen, E.Leoni, Valeria AlejandraGeneralized Limited PackingJoinUnionP4-Partnershttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1By using modular decomposition and handling certain graph operations such as join and union, we show that the Generalized Limited Packing Problem—NP-complete in general—can be solved in polynomial time in some graph classes with a limited number of P4-partners; specifically P4-tidy graphs, which contain cographs and P4-sparse graphs. In particular, we describe an algorithm to compute the associated numbers in polynomial time within these graph classes. In this way, we generalize some of the previous results on the subject. We also make some progress on the study of the computational complexity of the Generalized Multiple Domination Problem in graphs.Fil: Dobson, M. P.. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; ArgentinaFil: Hinrichsen, E.. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; ArgentinaFil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Cientifico Tecnológico Rosario; ArgentinaElsevier Science2015-05info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/13338Dobson, M. P.; Hinrichsen, E.; Leoni, Valeria Alejandra; Generalized limited packings of some graphs with a limited number of P4-partners; Elsevier Science; Theoretical Computer Science; 579; 5-2015; 1-80304-3975enginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2014.11.014info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0304397514008573info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:58:17Zoai:ri.conicet.gov.ar:11336/13338instacron: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 09:58:17.981CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Generalized limited packings of some graphs with a limited number of P4-partners |
title |
Generalized limited packings of some graphs with a limited number of P4-partners |
spellingShingle |
Generalized limited packings of some graphs with a limited number of P4-partners Dobson, M. P. Generalized Limited Packing Join Union P4-Partners |
title_short |
Generalized limited packings of some graphs with a limited number of P4-partners |
title_full |
Generalized limited packings of some graphs with a limited number of P4-partners |
title_fullStr |
Generalized limited packings of some graphs with a limited number of P4-partners |
title_full_unstemmed |
Generalized limited packings of some graphs with a limited number of P4-partners |
title_sort |
Generalized limited packings of some graphs with a limited number of P4-partners |
dc.creator.none.fl_str_mv |
Dobson, M. P. Hinrichsen, E. Leoni, Valeria Alejandra |
author |
Dobson, M. P. |
author_facet |
Dobson, M. P. Hinrichsen, E. Leoni, Valeria Alejandra |
author_role |
author |
author2 |
Hinrichsen, E. Leoni, Valeria Alejandra |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Generalized Limited Packing Join Union P4-Partners |
topic |
Generalized Limited Packing Join Union P4-Partners |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
By using modular decomposition and handling certain graph operations such as join and union, we show that the Generalized Limited Packing Problem—NP-complete in general—can be solved in polynomial time in some graph classes with a limited number of P4-partners; specifically P4-tidy graphs, which contain cographs and P4-sparse graphs. In particular, we describe an algorithm to compute the associated numbers in polynomial time within these graph classes. In this way, we generalize some of the previous results on the subject. We also make some progress on the study of the computational complexity of the Generalized Multiple Domination Problem in graphs. Fil: Dobson, M. P.. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; Argentina Fil: Hinrichsen, E.. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; Argentina Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Cs.exactas Ingenieria y Agrimensura. Escuela de Cs.exactas y Naturales. Departamento de Matematica; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Cientifico Tecnológico Rosario; Argentina |
description |
By using modular decomposition and handling certain graph operations such as join and union, we show that the Generalized Limited Packing Problem—NP-complete in general—can be solved in polynomial time in some graph classes with a limited number of P4-partners; specifically P4-tidy graphs, which contain cographs and P4-sparse graphs. In particular, we describe an algorithm to compute the associated numbers in polynomial time within these graph classes. In this way, we generalize some of the previous results on the subject. We also make some progress on the study of the computational complexity of the Generalized Multiple Domination Problem in graphs. |
publishDate |
2015 |
dc.date.none.fl_str_mv |
2015-05 |
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/13338 Dobson, M. P.; Hinrichsen, E.; Leoni, Valeria Alejandra; Generalized limited packings of some graphs with a limited number of P4-partners; Elsevier Science; Theoretical Computer Science; 579; 5-2015; 1-8 0304-3975 |
url |
http://hdl.handle.net/11336/13338 |
identifier_str_mv |
Dobson, M. P.; Hinrichsen, E.; Leoni, Valeria Alejandra; Generalized limited packings of some graphs with a limited number of P4-partners; Elsevier Science; Theoretical Computer Science; 579; 5-2015; 1-8 0304-3975 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2014.11.014 info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0304397514008573 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf 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_ |
1844613737739190272 |
score |
13.070432 |