Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes

Meeks, K. (2022) Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes. In: Computability in Europe: Revolutions and Revelations in Computability (CiE 2022), Swansea, UK, 11-15 Jul 2022, pp. 186-195. ISBN 9783031087394 (doi: 10.1007/978-3-031-08740-0_16)

[img] Text
269607.pdf - Accepted Version
Restricted to Repository staff only until 26 June 2023.



In many settings there is a need to reduce the spread of something undesirable, such as a virus, through a network. Typically, the network in which the spreading process takes place is not fixed but is subject to discrete changes over time; a natural formalism for such networks is that of temporal graphs. In this paper we survey three types of modifications that have been proposed in order to reduce reachability in temporal graphs, as well as the computational complexity of identifying optimal strategies for reducing reachability using each type of modification. We then go on to discuss several limitations of the current frameworks as models for intervention against real-world spreading processes, and suggest how these might be addressed in future research.

Item Type:Conference Proceedings
Additional Information:The work described here has been supported by EPSRC grants EP/T004878/1 and EP/V032305/1, and a Royal Society of Edinburgh Personal Research Fellowship (funded by the Scottish Government).
Glasgow Author(s) Enlighten ID:Meeks, Dr Kitty
Authors: Meeks, K.
College/School:College of Science and Engineering > School of Computing Science
Published Online:26 June 2022
Copyright Holders:Copyright © The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
First Published:First published in Revolutions and Revelations in Computability. CiE 2022. Lecture Notes in Computer Science, vol 13359: 186-195
Publisher Policy:Reproduced in accordance with the publisher copyright policy
Related URLs:

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

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
305944Multilayer Algorithmics to Leverage Graph StructureKitty MeeksEngineering and Physical Sciences Research Council (EPSRC)EP/T004878/1M&S - Statistics
312197Beyond One Solution in Combinatorial OptimisationKitty MeeksEngineering and Physical Sciences Research Council (EPSRC)EP/V032305/1Computing Science