Complexity of positive influence domination on partial grids

DOI10.1007/978-3-032-04700-7_20MaRDI QIDQ6852216zbMATH OpenFDO

Authors Enrico Iurlano, Günther R. Raidl

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_20

zbMATH Keywords

NP-hardnesspartial gridspositive influence domination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• (Total) vector domination for graphs with bounded branchwidth
• -domination
• A survey on alliances and related parameters in graphs
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• Every planar map is four colorable. I: Discharging
• Face covers and the genus problem for apex graphs
• Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
• scientific article; zbMATH DE number 861417 (Why is no real title available?)
• Kernelization and Lower Bounds of the Signed Domination Problem
• Local majorities, coalitions and monopolies in graphs: A review
• Minus domination in small-degree graphs
• On Dominating Sets and Independent Sets of Graphs
• On positive influence dominating sets in social networks
• On the algorithmic complexity of \(k\)-tuple total domination
• Parameterized Algorithms for Generalized Domination
• Positive Influence Dominating Set in Online Social Networks
• Positive influence domination in graphs
• The 2-domination and Roman domination numbers of grid graphs
• The domination number of grids
• Total 2-domination in grid graphs
• Transmitting in the n-dimensional cube
• Unit disk graphs
• Universality considerations in VLSI circuits

This page was built for publication: Complexity of positive influence domination on partial grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852216)