Limited Packing and Multiple Domination problems: Polynomial time reductions
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 probl...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| País: | Argentina |
| Recursos: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/21872 |
| Acesso em linha: | http://hdl.handle.net/11336/21872 |
| Access Level: | acceso abierto |
| Palavra-chave: | COMPUTATIONAL COMPLEXITY K-LIMITED PACKING K-TUPLE DOMINATING SET POLYNOMIAL TIME REDUCTIONS https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Resumo: | 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. |
|---|