Pages that link to "Item:Q5009485"
From MaRDI portal
The following pages link to Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485):
Displaying 3 items.
- Target set selection parameterized by vertex cover and more (Q2082561) (← links)
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
- 13th International Symposium on Parameterized and Exact Computation (IPEC 2018) (Q4626435) (← links)
