Pages that link to "Item:Q5127178"
From MaRDI portal
The following pages link to Target Set Selection Parameterized by Clique-Width and Maximum Threshold (Q5127178):
Displaying 8 items.
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- Target set selection parameterized by vertex cover and more (Q2082561) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
