Temporal flows in Temporal networks

Akrida, E ORCID: 0000-0002-1126-1623, Czyzowicz, Jurek, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Kuszner, Lukasz and Spirakis, Paul ORCID: 0000-0001-5396-3749
(2019) Temporal flows in Temporal networks. Journal of Computer and System Sciences, 103. pp. 46-60.

[img] Text
manuscript.pdf - Author Accepted Manuscript

Download (941kB)


We introduce temporal flows on temporal networks. We show that one can find the maximum amount of flow that can pass from a source vertex s to a sink vertex t up to a given time in Polynomial time. We provide a static Time-Extended network (TEG) of polynomial size to the input, and show that temporal flows can be decomposed into flows, each moving through a single temporal path. We then examine the case of unbounded node buffers. We prove that the maximum temporal flow is equal to the value of the minimum temporal s-t cut. We partially characterise networks with random edge availabilities that tend to eliminate the temporal flow. We also consider mixed temporal networks, where some edges have specified availabilities and some edges have random availabilities; we define the truncated expectation of the maximum temporal flow and show that it is #P-hard to compute it.

Item Type: Article
Uncontrolled Keywords: temporal networks, netowkr flows, random input, edge availability
Depositing User: Symplectic Admin
Date Deposited: 15 Mar 2019 14:19
Last Modified: 19 Jan 2023 00:56
DOI: 10.1016/j.jcss.2019.02.003
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3034345