On the complexity of the labeled domination problem in graphs

Autores
Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel
Año de publicación
2017
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination, {k} -domination, and M-domination, among others) was introduced. The labeled domination problem is to find an L-dominating function of minimum weight in a graph. It is an NP-complete problem even when restricted to split graphs and bipartite graphs. On the other hand, it is known to be polynomial-time solvable for the class of strongly chordal graphs. In this paper, we state explicit formulas that relate the domination numbers considered. These relationships allow us to enlarge the family of graphs where the labeled domination problem is polynomial-time solvable to the class of graphs having cliquewidth bounded by a constant.
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Torres, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Materia
Computational Complexity
K-Tuple Dominating Function
Labeled Dominating Function
{K}-Dominating Function
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/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/53215
Acceder
id CONICETDig_db2596b353106880d8f64ebe5c5d4682
oai_identifier_str oai:ri.conicet.gov.ar:11336/53215
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling On the complexity of the labeled domination problem in graphsArgiroffo, Gabriela RutLeoni, Valeria AlejandraTorres, Pablo DanielComputational ComplexityK-Tuple Dominating FunctionLabeled Dominating Function{K}-Dominating Functionhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination, {k} -domination, and M-domination, among others) was introduced. The labeled domination problem is to find an L-dominating function of minimum weight in a graph. It is an NP-complete problem even when restricted to split graphs and bipartite graphs. On the other hand, it is known to be polynomial-time solvable for the class of strongly chordal graphs. In this paper, we state explicit formulas that relate the domination numbers considered. These relationships allow us to enlarge the family of graphs where the labeled domination problem is polynomial-time solvable to the class of graphs having cliquewidth bounded by a constant.Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Torres, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaBlackwell Publishers2017-01info: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/53215Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; On the complexity of the labeled domination problem in graphs; Blackwell Publishers; International Transactions in Operational Research; 24; 1-2; 1-2017; 355-3670969-6016CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1111/itor.12286info:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12286info: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:46:36Zoai:ri.conicet.gov.ar:11336/53215instacron: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:46:36.477CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv On the complexity of the labeled domination problem in graphs
title On the complexity of the labeled domination problem in graphs
spellingShingle On the complexity of the labeled domination problem in graphs
Argiroffo, Gabriela Rut
Computational Complexity
K-Tuple Dominating Function
Labeled Dominating Function
{K}-Dominating Function
title_short On the complexity of the labeled domination problem in graphs
title_full On the complexity of the labeled domination problem in graphs
title_fullStr On the complexity of the labeled domination problem in graphs
title_full_unstemmed On the complexity of the labeled domination problem in graphs
title_sort On the complexity of the labeled domination problem in graphs
dc.creator.none.fl_str_mv Argiroffo, Gabriela Rut
Leoni, Valeria Alejandra
Torres, Pablo Daniel
author Argiroffo, Gabriela Rut
author_facet Argiroffo, Gabriela Rut
Leoni, Valeria Alejandra
Torres, Pablo Daniel
author_role author
author2 Leoni, Valeria Alejandra
Torres, Pablo Daniel
author2_role author
author
dc.subject.none.fl_str_mv Computational Complexity
K-Tuple Dominating Function
Labeled Dominating Function
{K}-Dominating Function
topic Computational Complexity
K-Tuple Dominating Function
Labeled Dominating Function
{K}-Dominating Function
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination, {k} -domination, and M-domination, among others) was introduced. The labeled domination problem is to find an L-dominating function of minimum weight in a graph. It is an NP-complete problem even when restricted to split graphs and bipartite graphs. On the other hand, it is known to be polynomial-time solvable for the class of strongly chordal graphs. In this paper, we state explicit formulas that relate the domination numbers considered. These relationships allow us to enlarge the family of graphs where the labeled domination problem is polynomial-time solvable to the class of graphs having cliquewidth bounded by a constant.
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Leoni, Valeria Alejandra. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Torres, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
description In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination, {k} -domination, and M-domination, among others) was introduced. The labeled domination problem is to find an L-dominating function of minimum weight in a graph. It is an NP-complete problem even when restricted to split graphs and bipartite graphs. On the other hand, it is known to be polynomial-time solvable for the class of strongly chordal graphs. In this paper, we state explicit formulas that relate the domination numbers considered. These relationships allow us to enlarge the family of graphs where the labeled domination problem is polynomial-time solvable to the class of graphs having cliquewidth bounded by a constant.
publishDate 2017
dc.date.none.fl_str_mv 2017-01
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/53215
Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; On the complexity of the labeled domination problem in graphs; Blackwell Publishers; International Transactions in Operational Research; 24; 1-2; 1-2017; 355-367
0969-6016
CONICET Digital
CONICET
url http://hdl.handle.net/11336/53215
identifier_str_mv Argiroffo, Gabriela Rut; Leoni, Valeria Alejandra; Torres, Pablo Daniel; On the complexity of the labeled domination problem in graphs; Blackwell Publishers; International Transactions in Operational Research; 24; 1-2; 1-2017; 355-367
0969-6016
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.1111/itor.12286
info:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12286
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 Blackwell Publishers
publisher.none.fl_str_mv Blackwell Publishers
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_ 1844613454793539584
score 13.070432

Publicaciones similares