
doi: 10.3390/a6030532
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.
Matching models, stable matchings, Industrial engineering. Management engineering, QA75.5-76.95, T55.4-60.8, stable flows, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Electronic computers. Computer science, Deterministic network models in operations research, Flows in graphs, flows over time
Matching models, stable matchings, Industrial engineering. Management engineering, QA75.5-76.95, T55.4-60.8, stable flows, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Electronic computers. Computer science, Deterministic network models in operations research, Flows in graphs, flows over time
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
