Algorithmic aspects of 2-secure domination in graphs

DOI10.1007/s10878-021-00739-9OpenAlexW3155641883MaRDI QIDQ2045038

Venkata Subba Reddy Palagiri, Pavan Kumar Jakkepalli

Publication date: 11 August 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00739-9

zbMATH Keywords

planar graphsinapproximabilityAPX-completeW[2-hard]2-secure dominationstar convex bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Algorithmic aspects of outer independent Roman domination in graphs ⋮ Algorithmic aspects of certified domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
• Approximation hardness of dominating set problems in bounded degree graphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Clustering to minimize the maximum intercluster distance
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Some APX-completeness results for cubic graphs
• Algorithmic aspects of semitotal domination in graphs
• Algorithmic aspects of secure connected domination in graphs
• Complexity issues of variants of secure domination in graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Two Hardness Results on Feedback Vertex Sets
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Algorithmic Aspects of Some Variants of Domination in Graphs
• Doubly chordal graphs, steiner trees, and connected domination

This page was built for publication: Algorithmic aspects of 2-secure domination in graphs