Algorithmic aspect of minus domination on small-degree graphs
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Combinatorial optimization (90C27)
Recommendations
Cites work
- FPT results for signed domination
- Minus domination in graphs
- Minus domination in small-degree graphs
- On complexities of minus domination
- Optimization, approximation, and complexity classes
- Parameterized complexity after (almost) ten years: Review and open questions
- Planar Formulae and Their Uses
- The algorithmic complexity of minus domination in graphs
Cited in
(11)- On complexities of minus domination
- The algorithmic complexity of minus domination in graphs
- On complexities of minus domination
- Algorithms and complexity of signed, minus, and majority domination
- Algorithmic aspects of minus total k-subdomination in graphs
- scientific article; zbMATH DE number 3929037 (Why is no real title available?)
- Minus domination in small-degree graphs (extended abstract)
- scientific article; zbMATH DE number 2104725 (Why is no real title available?)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- Structural parameterization of minus domination
- Structural parameterization of minus domination
This page was built for publication: Algorithmic aspect of minus domination on small-degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196397)