@inproceedings{a8dc087b24e44df9b327ed27820564ab,
title = "Temporal Reachability Minimization: Delaying vs. Deleting",
abstract = "We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how such a spreading process, emerging from a given set of sources, can be contained to a small part of the graph. To this end we consider two ways of modifying the graph, which are (1) deleting connections and (2) delaying connections. We show a close relationship between the two associated problems and give a polynomial time algorithm when the graph has tree structure. For the general version, we consider parameterization by the number of vertices to which the spread is contained. Surprisingly, we prove W[1]-hardness for the deletion variant but fixed-parameter tractability for the delaying variant.",
keywords = "Disease spreading, Network flows, Np-hard problems, Parameterized algorithms, Temporal graphs, Temporal paths",
author = "Hendrik Molter and Malte Renken and Philipp Zschoche",
note = "Publisher Copyright: {\textcopyright} Hendrik Molter, Malte Renken, and Philipp Zschoche; licensed under Creative Commons License CC-BY 4.0 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021).; 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021 ; Conference date: 23-08-2021 Through 27-08-2021",
year = "2021",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.MFCS.2021.76",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Filippo Bonchi and Puglisi, \{Simon J.\}",
booktitle = "46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021",
address = "Germany",
}
