Target Set Selection Parameterized by Clique-Width and Maximum Threshold
From MaRDI portal
Publication:5127178
DOI10.1007/978-3-319-73117-9_10zbMath1444.68144arXiv1710.00635OpenAlexW2762196021MaRDI QIDQ5127178
Publication date: 21 October 2020
Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.00635
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (9)
A parameterized complexity view on collapsing \(k\)-cores ⋮ Target Set Selection in Dense Graph Classes ⋮ Establishing herd immunity is hard even in simple geometric networks ⋮ Target set selection with maximum activation time ⋮ Solving target set selection with bounded thresholds faster than \(2^n\) ⋮ Dynamic monopolies for interval graphs with bounded thresholds ⋮ Solving Target Set Selection with Bounded Thresholds Faster than 2^n ⋮ On some tractable and hard instances for partial incentives and target set selection ⋮ Target set selection parameterized by vertex cover and more
This page was built for publication: Target Set Selection Parameterized by Clique-Width and Maximum Threshold
