| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419034 | Discrete Applied Mathematics | 2014 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
V. Leoni, G. Nasini,