Target set selection with maximum activation time

DOI10.1016/J.PROCS.2021.11.014MaRDI QIDQ6890915zbMATH OpenFDO

Authors Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau

Publication date 2 December 2025

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

zbMATH Keywords

treebipartite graphcomplexity dichotomyfixed-parameter tractabilityplanar graphtarget set selectionbounded local treewidthactivation time

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Target set selection with maximum activation time

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