Enright, J. , Meeks, K. and Skerman, F. (2021) Assigning times to minimise reachability in temporal graphs. Journal of Computer and System Sciences, 115, pp. 169-186. (doi: 10.1016/j.jcss.2020.08.001)
|
Text
222185.pdf - Published Version Available under License Creative Commons Attribution. 617kB |
Abstract
Temporal graphs (in which edges are active at specified times) are of particular relevance for spreading processes on graphs, e.g. the spread of disease or dissemination of information. Motivated by real-world applications, modification of static graphs to control this spread has proven a rich topic for previous research. Here, we introduce a new type of modification for temporal graphs: the number of active times for each edge is fixed, but we can change the relative order in which (sets of) edges are active. We investigate the problem of determining an ordering of edges that minimises the maximum number of vertices reachable from any single starting vertex; epidemiologically, this corresponds to the worst-case number of vertices infected in a single disease outbreak. We study two versions of this problem, both of which we show to be -hard, and identify cases in which the problem can be solved or approximated efficiently.
| Item Type: | Articles |
|---|---|
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Meeks, Dr Kitty and Enright, Dr Jessica |
| Creator Roles: | Enright, J.Conceptualization, Formal analysis, Investigation, Methodology, Writing – original draft, Writing – review and editing Meeks, K.Conceptualization, Formal analysis, Investigation, Methodology, Writing – original draft, Writing – review and editing |
| Authors: | Enright, J., Meeks, K., and Skerman, F. |
| College/School: | College of Science and Engineering > School of Computing Science |
| Journal Name: | Journal of Computer and System Sciences |
| Publisher: | Elsevier |
| ISSN: | 0022-0000 |
| ISSN (Online): | 1090-2724 |
| Published Online: | 20 August 2020 |
| Copyright Holders: | Copyright © 2020 The Author(s). |
| First Published: | First published in Journal of Computer and System Sciences 115:169-186 |
| Publisher Policy: | Reproduced under a Creative Commons license |
University Staff: Request a correction | Enlighten Editors: Update this record
Funder and Project Information
Funder and Project Information