Target Set Selection Parameterized by Clique-Width and Maximum Threshold

Tim A. Hartmann

The Target Set Selection problem takes as an input a graph $G$ and a non-negative integer threshold $ \mbox{thr}(v) $ for every vertex $v$. A vertex $v$ can get active as soon as a…