Limited Packing and Multiple Domination problems: Polynomial time reductions

Authors:
V. Leoni;G. Nasini
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 3
Cited 0

k-tuple domination in graphs

Information Processing Letters
Limited packings in graphs

Discrete Applied Mathematics
The multiple domination and limited packing problems in graphs

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

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.