Temporal reachability minimization: delaying vs. deleting

DOI10.1016/j.jcss.2024.103549MaRDI QIDQ6564622

Hendrik Molter, Philipp Zschoche, Malte Renken

Publication date: 1 July 2024

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

network flowsNP-hard problemsparameterized algorithmstemporal graphsdisease spreadingtemporal paths

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Temporal reachability minimization: delaying vs. deleting