On Structural Parameterizations of the Harmless Set Problem
From MaRDI portal
(Redirected from Publication:6492087)
Cites work
- A survey of integrity
- Algorithmic meta-theorems for restrictions of treewidth
- Approximation Algorithms and Hardness for Domination with Propagation
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
- Constant thresholds can make target set selection tractable
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Graph Layout Problems Parameterized by Vertex Cover
- Graph minors. III. Planar tree-width
- Harmless sets in sparse classes
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Irreversible conversion of graphs
- Local majorities, coalitions and monopolies in graphs: A review
- Minkowski's Convex Body Theorem and Integer Programming
- Modular decomposition and transitive orientation
- On the approximability of influence in social networks
- On the harmless set problem parameterized by treewidth
- Parameterized algorithms
- Parameterized approximability of maximizing the spread of influence in networks
- Recent developments on graphs of bounded clique-width
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Some results on the target set selection problem
- The complexity of finding harmless individuals in social networks
- Treewidth governs the complexity of target set selection
- Treewidth. Computations and approximations
- Upper bounds to the clique width of graphs
- Variants of spreading messages
- Which problems have strongly exponential complexity?
This page was built for publication: On Structural Parameterizations of the Harmless Set Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492087)
