Temporal flows in temporal networks
Eleni C. Akrida , Jurek Czyżowicz , Leszek Gąsieniec , Łukasz Kuszner , Paul G. Spirakis
AbstractWe 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.
|Journal series||Journal of Computer and System Sciences, ISSN 0022-0000, (N/A 100 pkt)|
|Publication size in sheets||0.7|
|Keywords in English||temporal networks, network flows, random input, edge availability|
|ASJC Classification||; ; ;|
|Score||= 100.0, 10-12-2019, ArticleFromJournal|
|Publication indicators||= 1; : 2018 = 1.334; : 2018 = 1.129 (2) - 2018=1.739 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.