Temporal Reachability Minimization: Delaying vs. Deleting

Hendrik Molter, Malte Renken, Philipp Zschoche

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

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.

Original languageEnglish
Title of host publication46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021
EditorsFilippo Bonchi, Simon J. Puglisi
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772013
DOIs
StatePublished - 1 Aug 2021
Event46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021 - Tallinn, Estonia
Duration: 23 Aug 202127 Aug 2021

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume202
ISSN (Print)1868-8969

Conference

Conference46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021
Country/TerritoryEstonia
CityTallinn
Period23/08/2127/08/21

Keywords

  • Disease spreading
  • Network flows
  • Np-hard problems
  • Parameterized algorithms
  • Temporal graphs
  • Temporal paths

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Temporal Reachability Minimization: Delaying vs. Deleting'. Together they form a unique fingerprint.

Cite this