%0 Journal Article
%T Stable Flows over Time
%A ¨¢gnes Cseh
%A Jannik Matuschke
%A Martin Skutella
%J Algorithms
%D 2013
%I MDPI AG
%R 10.3390/a6030532
%X In this paper, the notion of stability is extended to network flows over time. As a useful device in our proofs, we present an elegant preflow-push variant of the Gale-Shapley algorithm that operates directly on the given network and computes stable flows in pseudo-polynomial time, both in the static flow and the flow over time case. We show periodical properties of stable flows over time on networks with an infinite time horizon. Finally, we discuss the influence of storage at vertices, with different results depending on the priority of the corresponding holdover edges.
%K stable matchings
%K stable flows
%K flows over time
%U http://www.mdpi.com/1999-4893/6/3/532