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

Enright, J. , Meeks, K. , Mertzios, G. B. and Zamaraev, V. (2021) Deleting edges to restrict the size of an epidemic in temporal networks. Journal of Computer and System Sciences, 119, pp. 60-77. (doi: 10.1016/j.jcss.2021.01.007)

[img] Text
233459.pdf - Accepted Version



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:Articles
Glasgow Author(s) Enlighten ID:Meeks, Dr Kitty and Enright, Dr Jessica
Authors: Enright, J., Meeks, K., Mertzios, G. B., and Zamaraev, V.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Journal of Computer and System Sciences
ISSN (Online):1090-2724
Published Online:12 February 2021
Copyright Holders:Copyright © 2021 Elsevier
First Published:First published in Journal of Computer and System Sciences 119:60-77
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record