Parameterized complexity of weighted target set selection

DOI10.1016/J.TCS.2025.115414MaRDI QIDQ6949547zbMATH OpenFDO

Authors Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou

Publication date 1 August 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph algorithmsparameterized complexitytarget-set selection

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Parameterized complexity of weighted target set selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949547)