Back to Search
Start Over
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow.
- Source :
- Communications of the ACM; Dec2023, Vol. 66 Issue 12, p85-92, 8p
- Publication Year :
- 2023
-
Abstract
- The article discusses an algorithm designed to compute maximum flow and minimum-cost flows. It builds on the works of prior researchers to propose new theorems and provides formulas and graphs to illustrate these theorems and schemes.
Details
- Language :
- English
- ISSN :
- 00010782
- Volume :
- 66
- Issue :
- 12
- Database :
- Complementary Index
- Journal :
- Communications of the ACM
- Publication Type :
- Periodical
- Accession number :
- 173715676
- Full Text :
- https://doi.org/10.1145/3610940