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...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 164; pp. 547 - 553
Main Authors:	Leoni, V., Nasini, G.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 19-02-2014
Subjects:	[formula omitted]-limited packing [formula omitted]-tuple dominating set Complexity Computation Computational complexity Graphs Mathematical models Polynomial time reductions Polynomials Reduction k-limited packing Polynomial time reductions k-tuple dominating set Computational complexity
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0166-218X 1872-6771
DOI:	10.1016/j.dam.2013.10.023