On stable flows and preflows
From MaRDI portal
Abstract: In 2010s Fleiner introduced a notion of stable flows in directed networks and showed that such a flow always exists and can be found by use of a reduction to the stable allocation problem due to Baiou and Balinski. Recently Cseh and Matuschke devised a direct strongly polynomial algorithm. In this paper we give an alternative algorithm to find a stable flow in a network with several sources and sinks. It is based on an idea of preflows (appeared in 1970s in a faster algorithm for the classical max-flow problem), and runs in time for a network with vertices and edges. The results are further generalized to a larger class of objects, so-called stable quasi-flows with bounded excesses in non-terminal vertices. (The paper is written in Russian.)
Cites work
- A data structure for dynamic trees
- A necessary and sufficient condition for the existence of a complete stable matching
- An efficient algorithm for the “stable roommates” problem
- College Admissions and the Stability of Marriage
- Erratum: The Stable Allocation (or Ordinal Transportation) Problem
- Faster algorithms for stable allocation problems
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- On stable matchings and flows
- Self-adjusting binary search trees
- Stable flows over time
This page was built for publication: On stable flows and preflows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039791)