Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks

Enright, J. , Meeks, K. , Mertzios, G. B. and Zamaraev, V. (2019) Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Aachen, Germany, 26-30 Aug 2019, p. 57. ISBN 9783959771177 (doi:10.4230/LIPIcs.MFCS.2019.57)

[img]
Preview
Text
189166.pdf - Published Version
Available under License Creative Commons Attribution.

535kB

Abstract

Spreading processes on graphs are a natural model for a wide variety of real-world phenomena, including information or behaviour spread over social networks, biological diseases spreading over contact or trade networks, and the potential flow of goods over logistical infrastructure. Often, the networks over which these processes spread are dynamic in nature, and can be modeled with graphs whose structure is subject to discrete changes over time, i.e. with temporal graphs. Here, we consider temporal graphs in which edges are available at specified timesteps, and 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 (i.e. a path, along which the times of the edge availabilities increase). We introduce a natural deletion problem for temporal graphs and we provide positive and negative results on its computational complexity, both in the traditional and the parameterised sense (subject to various natural parameters), as well as addressing the approximability of this problem.

Item Type:Conference Proceedings
Additional Information:Funding: Kitty Meeks: supported by a Royal Society of Edinburgh Personal Research Fellowship, funded by the Scottish Government. George B. Mertzios: partially supported by the EPSRC Grants EP/P020372/1 Viktor Zamaraev: supported by the EPSRC Grant EP/P020372/1
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Enright, Dr Jessica and Meeks, Dr Kitty
Authors: Enright, J., Meeks, K., Mertzios, G. B., and Zamaraev, V.
College/School:College of Medical Veterinary and Life Sciences > Institute of Biodiversity Animal Health and Comparative Medicine
College of Science and Engineering > School of Computing Science
ISSN:1868-8969
ISBN:9783959771177
Copyright Holders:Copyright © 2019 Jessica Enright, Kitty Meeks, George B. Mertzios, and Viktor Zamaraev
First Published:First published in Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019): 57
Publisher Policy:Reproduced under a Creative Commons License
Related URLs:

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

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
173318Exploiting realistic graph structureKitty MeeksThe Royal Society of Edinburgh (ROYSOCED)Personal Research FellowsComputing Science