Algorithmic aspects of \(k\)-tuple total domination in graphs

DOI10.1016/j.ipl.2012.07.010zbMath1248.68222MaRDI QIDQ456136

J. Herrera, D. Rodríguez-Gómez

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.07.010

zbMATH Keywords

graph algorithms; NP-complete; domination; APX-complete; total domination; \(k\)-tuple total domination

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms