INVESTIGADORES
LEONI Valeria Alejandra
artículos
Título:
Limited Packing and Multiple Domination problems: polynomial time reductions
Autor/es:
V. LEONI; G. NASINI
Revista:
DISCRETE APPLIED MATHEMATICS
Editorial:
ELSEVIER SCIENCE BV
Referencias:
Lugar: Amsterdam; Año: 2014 vol. 164 p. 547 - 553
ISSN:
0166-218X
Resumen:
The Limited Packing and Multiple Domination problems in graphs have closely-related definitionsand the same computational complexity on several graph classes. In this work wepresent two polynomial time reductions between them. Besides,wetake into considerationgeneralized versions of these problems and obtain polynomial time reductions betweeneach one and its generalized version.
