Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs

DOI10.1016/j.endm.2011.05.036zbMath1268.05197OpenAlexW2001366346MaRDI QIDQ2840710

V. Leoni, Maria Patricia Dobson, Graciela L. Nasini

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.036

zbMATH Keywords

computational complexityreductions\(k\)-limited packing\(k\)-tuple dominating set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Limited packing and multiple domination problems: polynomial time reductions

Cites Work

• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• Limited packings in graphs
• \(k\)-tuple domination in graphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs

This page was built for publication: Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs