Total 2-domination of proper interval graphs
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 no...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2021 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/173291 |
| Acceso en línea: | http://hdl.handle.net/11336/173291 |
| Access Level: | acceso abierto |
| Palabra clave: | PROPER INTERVAL GRAPHS STRAIGHT ORIENTED GRAPHS TOTAL 2-DOMINATION https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
| Sumario: | 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. |
|---|