Target set selection parameterized by vertex cover and more
From MaRDI portal
Recommendations
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Target set selection with maximum activation time
- On approximating target set selection
- Domination and convexity problems in the target set selection model
Cites work
- Can you beat treewidth?
- Constant thresholds can make target set selection tractable
- Integer Programming with a Fixed Number of Variables
- Latency-bounded target set selection in social networks
- On the approximability of influence in social networks
- Parameterized algorithms
- Parameterized inapproximability of target set selection and generalizations
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Some results on the target set selection problem
- Target set selection in dense graph classes
- Target set selection parameterized by clique-width and maximum threshold
- Treewidth governs the complexity of target set selection
Cited in
(7)- Some results on the target set selection problem
- Target Set Selection in Dense Graph Classes
- On the complexity of target set selection in simple geometric networks
- Parameterized complexity of weighted target set selection
- Parameterized complexity of weighted target set selection
- Balancing the spread of two opinions in sparse social networks
- The conversion set problem on graphs
This page was built for publication: Target set selection parameterized by vertex cover and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082561)
