Target set selection for conservative populations
From MaRDI portal
Publication:2235265
DOI10.1016/j.dam.2021.09.003OpenAlexW3199635385MaRDI QIDQ2235265
Publication date: 21 October 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.03422
Related Items (5)
Parameterized complexity of immunization in the threshold model ⋮ Immunization in the threshold model: a parameterized complexity study ⋮ On approximating the rank of graph divisors ⋮ Target set selection for conservative populations ⋮ On reconfigurability of target sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Linearity of grid minors in treewidth with applications through bidimensionality
- Minimum weakly fundamental cycle bases are hard to find
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- On the hardness of approximating label-cover
- Packing directed circuits fractionally
- On some tractable and hard instances for partial incentives and target set selection
- Target set selection for conservative populations
- Whom to befriend to influence people
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
- Optimizing Spread of Influence in Social Networks via Partial Incentives
- On the power of unique 2-prover 1-round games
- On the Approximability of Influence in Social Networks
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- A contraction algorithm for finding small cycle cutsets
- Irreversible 2-conversion set in graphs of bounded degree
- On Approximating Target Set Selection
- Parameterized Inapproximability of Target Set Selection and Generalizations
This page was built for publication: Target set selection for conservative populations
