Algorithmic complexity of secure connected domination in graphs

DOI10.1016/J.AKCEJ.2019.08.012zbMath1471.05085arXiv2002.00713OpenAlexW3047855937MaRDI QIDQ4956219

No author found.

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.00713

zbMATH Keywords

dominationsecure dominationsecure connected dominationw[2-hard problem]

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (5)

Complexity results on cosecure domination in graphs ⋮ On the complexity of co-secure dominating set problem ⋮ Secure connected domination and secure total domination in unit disk graphs and rectangle graphs ⋮ Algorithmic aspects of certified domination in graphs ⋮ Algorithmic aspects of secure connected domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Dominating sets for split and bipartite graphs
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
• Threshold graphs and related topics

This page was built for publication: Algorithmic complexity of secure connected domination in graphs