Total 2-domination of proper interval graphs

Autores
Soulignac, Francisco Juan
Año de publicación
2021
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
A set of vertices W of a graph G is a total k-dominating set when every vertex of G has at least k neighbors in W. In a recent article, Chiarelli et al. (2019) prove that a total k-dominating set can be computed in O(n3k) time when G is a proper interval graph with n vertices and m edges. In this note we reduce the time complexity to O(m) for k=2.
Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; Argentina
Materia
PROPER INTERVAL GRAPHS
STRAIGHT ORIENTED GRAPHS
TOTAL 2-DOMINATION
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/173291
Acceder
id CONICETDig_ff6f7a87d88a6dee3ba2f481423a30be
oai_identifier_str oai:ri.conicet.gov.ar:11336/173291
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Total 2-domination of proper interval graphsSoulignac, Francisco JuanPROPER INTERVAL GRAPHSSTRAIGHT ORIENTED GRAPHSTOTAL 2-DOMINATIONhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1A set of vertices W of a graph G is a total k-dominating set when every vertex of G has at least k neighbors in W. In a recent article, Chiarelli et al. (2019) prove that a total k-dominating set can be computed in O(n3k) time when G is a proper interval graph with n vertices and m edges. In this note we reduce the time complexity to O(m) for k=2.Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; ArgentinaElsevier Science2021-10info: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/173291Soulignac, Francisco Juan; Total 2-domination of proper interval graphs; Elsevier Science; Discrete Applied Mathematics; 302; 10-2021; 256-2620166-218XCONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2021.07.015info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1812.00689?context=math.CO#:~:text=A%20set%20of%20vertices%20W,Graphs%2C%20Lecture%20Notes%20in%20Comput.info: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-11-05T09:52:02Zoai:ri.conicet.gov.ar:11336/173291instacron: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-11-05 09:52:02.577CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Total 2-domination of proper interval graphs
title Total 2-domination of proper interval graphs
spellingShingle Total 2-domination of proper interval graphs
Soulignac, Francisco Juan
PROPER INTERVAL GRAPHS
STRAIGHT ORIENTED GRAPHS
TOTAL 2-DOMINATION
title_short Total 2-domination of proper interval graphs
title_full Total 2-domination of proper interval graphs
title_fullStr Total 2-domination of proper interval graphs
title_full_unstemmed Total 2-domination of proper interval graphs
title_sort Total 2-domination of proper interval graphs
dc.creator.none.fl_str_mv Soulignac, Francisco Juan
author Soulignac, Francisco Juan
author_facet Soulignac, Francisco Juan
author_role author
dc.subject.none.fl_str_mv PROPER INTERVAL GRAPHS
STRAIGHT ORIENTED GRAPHS
TOTAL 2-DOMINATION
topic PROPER INTERVAL GRAPHS
STRAIGHT ORIENTED GRAPHS
TOTAL 2-DOMINATION
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv A set of vertices W of a graph G is a total k-dominating set when every vertex of G has at least k neighbors in W. In a recent article, Chiarelli et al. (2019) prove that a total k-dominating set can be computed in O(n3k) time when G is a proper interval graph with n vertices and m edges. In this note we reduce the time complexity to O(m) for k=2.
Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; Argentina
description A set of vertices W of a graph G is a total k-dominating set when every vertex of G has at least k neighbors in W. In a recent article, Chiarelli et al. (2019) prove that a total k-dominating set can be computed in O(n3k) time when G is a proper interval graph with n vertices and m edges. In this note we reduce the time complexity to O(m) for k=2.
publishDate 2021
dc.date.none.fl_str_mv 2021-10
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/173291
Soulignac, Francisco Juan; Total 2-domination of proper interval graphs; Elsevier Science; Discrete Applied Mathematics; 302; 10-2021; 256-262
0166-218X
CONICET Digital
CONICET
url http://hdl.handle.net/11336/173291
identifier_str_mv Soulignac, Francisco Juan; Total 2-domination of proper interval graphs; Elsevier Science; Discrete Applied Mathematics; 302; 10-2021; 256-262
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.2021.07.015
info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1812.00689?context=math.CO#:~:text=A%20set%20of%20vertices%20W,Graphs%2C%20Lecture%20Notes%20in%20Comput.
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_ 1847977252103389184
score 13.087074

Publicaciones similares