More on the complexity of defensive domination in graphs
From MaRDI portal
Publication:6657275
DOI10.1016/J.DAM.2024.11.023MaRDI QIDQ6657275
Arti Pandey, Michael A. Henning, Vikash Tripathi
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
NP-completenessgraph algorithmsdominationapproximation algorithmsAPX-completenessdefensive domination
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of parameterized complexity
- The upper bound on \(k\)-tuple domination numbers of graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- \(k\)-tuple domination in graphs
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Some APX-completeness results for cubic graphs
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- On the approximability and exact algorithms for vector domination and related problems in graphs
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- New bounds on the double domination number of trees
- Approximation algorithm and hardness results for defensive domination in graphs
- The complexity of the defensive domination problem in special graph classes
- Cops, a fast robber and defensive domination on interval graphs
- Characterization of double domination subdivision number of trees
- Defensive domination in proper interval graphs
- Alliances and Related Domination Parameters
- Algorithms and Complexity of Alliances in Graphs
- A note on the k-tuple domination number of graphs
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- Analytical approach to parallel repetition
- Double domination in rooted product graphs
This page was built for publication: More on the complexity of defensive domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657275)
