On the harmless set problem parameterized by treewidth
From MaRDI portal
Publication:2154099
Cites work
- Algorithmic meta-theorems for restrictions of treewidth
- Approximation Algorithms and Hardness for Domination with Propagation
- Constant thresholds can make target set selection tractable
- Graph Layout Problems Parameterized by Vertex Cover
- Graph minors. III. Planar tree-width
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 5917571 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (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
- On the approximability of influence in social networks
- Parameterized algorithms
- Parameterized approximability of maximizing the spread of influence in networks
- 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
- Variants of spreading messages
Cited in
(2)
This page was built for publication: On the harmless set problem parameterized by treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154099)
