Temporal Graphs

Akrida, E ORCID: 0000-0002-1126-1623
(2016) Temporal Graphs. PhD thesis, University of Liverpool.

[img] Text
201004037_Nov2016.pdf - Unspecified

Download (790kB)
[img] Atom XML (admin)
2017-05-12T10:15:06Z.atom - Unspecified
Access to this file is embargoed until Unspecified.

Download (10kB)


This thesis studies Temporal Graphs, also called Temporal Networks. More specifically, the project aimed to carry out research on the properties of Temporal Graphs, both in general and in specific classes of the model, as well as examine and develop algorithms for solving problems in temporal graph theory. Temporal graphs are graphs that change -often dramatically- as time progresses, however maintaining a fixed number of vertices. We investigate a range of different temporal graph models depending on the way these changes occur, e.g., in a deterministic or probabilistic fashion, in a discrete-time or continuous-time context, etc. In particular, we examine connectivity matters in a model of temporal graphs where changes happen at random discrete moments in time. Within this framework, we also investigated a model of continuous time and developed algorithms that solve connectivity problems in that model. Furthermore, we study temporal network design issues for the discrete-time model of temporal graphs, both in cases where changes happen deterministically and in cases where changes happen at random discrete-time moments. We also introduce and investigate temporal network flows, where we define the problem of computing a maximum flow in a given temporal network and discuss efficient ways of solving it.

Item Type: Thesis (PhD)
Divisions: Faculty of Science and Engineering > School of Engineering
Depositing User: Symplectic Admin
Date Deposited: 13 Dec 2016 10:29
Last Modified: 19 Jan 2023 07:25
DOI: 10.17638/03004504
URI: https://livrepository.liverpool.ac.uk/id/eprint/3004504