On the parameterized complexity of \([1,j]\)-domination problems

DOI10.1016/j.tcs.2019.11.032zbMath1436.68147MaRDI QIDQ2283043

Fedor V. Fomin, Fahad Panolan, Amer E. Mouawad, Mohsen Alambardar Meybodi

Publication date: 27 December 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.11.032

zbMATH Keywords

parameterized complexity; sparse graphs; total dominating set; restrained dominating set; \([1, j\)-dominating set]

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

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

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

68Q27: Parameterized complexity, tractability and kernelization