Kernelization and Lower Bounds of the Signed Domination Problem
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) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- Lower bounds on the signed (total) \(k\)-domination number
- Lower bounds on several versions of signed domination number
- Lower bounds on the signed total k-domination number of graphs
- Lower bounds on the signed k-domination number of graphs.
- scientific article; zbMATH DE number 1932293
- scientific article; zbMATH DE number 825134
- Lower bounds on nonnegative signed domination parameters in graphs
- On the complexity of signed and minus total domination in graphs
- scientific article; zbMATH DE number 5257358
- Algorithms and Hardness for Signed Domination
Cited in
(9)- On complexities of minus domination
- On complexities of minus domination
- FPT results for signed domination
- Algorithms and Hardness for Signed Domination
- Signed and minus dominating functions in graphs
- scientific article; zbMATH DE number 6987353 (Why is no real title available?)
- Kernelization and Sparseness: the case of Dominating Set
- Complexity of positive influence domination on partial grids
- Discrepancy and signed domination in graphs and hypergraphs
This page was built for publication: Kernelization and Lower Bounds of the Signed Domination Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405938)