On the harmless set problem parameterized by treewidth
From MaRDI portal
Publication:2154099
DOI10.1007/978-3-030-96731-4_19OpenAlexW4226428167MaRDI QIDQ2154099
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_19
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Treewidth governs the complexity of target set selection
- Irreversible conversion of graphs
- Graph minors. III. Planar tree-width
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Local majorities, coalitions and monopolies in graphs: A review
- Algorithmic meta-theorems for restrictions of treewidth
- Some results on the target set selection problem
- Constant thresholds can make target set selection tractable
- The complexity of finding harmless individuals in social networks
- Integer Programming with a Fixed Number of Variables
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- On the Approximability of Influence in Social Networks
- Graph Layout Problems Parameterized by Vertex Cover
- Minkowski's Convex Body Theorem and Integer Programming
- Parameterized Approximability of Maximizing the Spread of Influence in Networks
- Parameterized Algorithms
- Variants of Spreading Messages
- Approximation Algorithms and Hardness for Domination with Propagation
This page was built for publication: On the harmless set problem parameterized by treewidth
