Recommendations
- Target Set Selection in Dense Graph Classes
- Target set selection parameterized by clique-width and maximum threshold
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Parameterized inapproximability of target set selection and generalizations
Cites work
- Algorithmic meta-theorems for restrictions of treewidth
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Local majorities, coalitions and monopolies in graphs: A review
- On tractable cases of target set selection
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
Cited in
(10)- Target set selection parameterized by vertex cover and more
- On reconfigurability of target sets
- Graph structured sparse subset selection
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Iterated Type Partitions
- Target Set Selection in Dense Graph Classes
- Immunization in the threshold model: a parameterized complexity study
- Weighted target set selection on trees and cycles
- Target set selection with maximum activation time
- A parameterized complexity view on collapsing \(k\)-cores
This page was built for publication: Target set selection in dense graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091008)
