1. Chen, L., Kyng, R., Liu, Y., Peng, R., Gutenberg, M. P., Sachdeva, S.: Maximum flow and minimum-cost flow in almost-linear time. arXiv:2203.00671 (2022)
2. Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Doklady 11, 1277–1280 (1970). (In Russian.)
3. Duan, R., He, H., Zhang, T.: A scaling algorithm for weighted f-factors in general graphs. In: Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Vol. 168 of LIPIcs, 41:1-41:17 (2020)
4. Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449–467 (1965)
5. Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM J. Comput. 4, 507–518 (1975)