Deleting edges to restrict the size of an epidemic in temporal networks

Enright, Jessica, Meeks, Kitty, Mertzios, George B and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2021) Deleting edges to restrict the size of an epidemic in temporal networks. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 119. pp. 60-77.

Text
JCSS_revision_submission_3.pdf - Author Accepted Manuscript
Download (571kB) | Preview

Official URL: http://dx.doi.org/10.1016/j.jcss.2021.01.007

Abstract

Spreading processes on graphs are a natural model for a wide variety of real-world phenomena, including information spread over social networks and biological diseases spreading over contact networks. Often, the networks over which these processes spread are dynamic in nature, and can be modelled with temporal graphs. Here, we study the problem of deleting edges from a given temporal graph in order to reduce the number of vertices (temporally) reachable from a given starting point. This could be used to control the spread of a disease, rumour, etc. in a temporal graph. In particular, our aim is to find a temporal subgraph in which a process starting at any single vertex can be transferred to only a limited number of other vertices using a temporally-feasible path. We introduce a natural edge-deletion problem for temporal graphs and provide positive and negative results on its computational complexity and approximability.

Item Type:	Article
Uncontrolled Keywords:	Temporal graphs, Reachability, Fixed-parameter tractability, Approximation algorithms
Depositing User:	Symplectic Admin
Date Deposited:	26 Feb 2021 16:01
Last Modified:	18 Jan 2023 22:59
DOI:	10.1016/j.jcss.2021.01.007
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3115893