Papers › Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
Nithin Kavi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In 2022, Chen et al. proposed an algorithm in \cite{main} that solves the min cost flow problem in m^(1 + o(1)) logU logC time, where m is the number of edges in the graph, U is an upper bound on capacities and C is an upper bound on costs. However, as far as the authors of \cite{main} know, no one has implemented their algorithm to date. In this paper, we discuss implementations of several key portions of the algorithm given in \cite{main}, including the justifications for specific implementation choices. For the portions of the algorithm that we do not implement, we provide stubs. We then go through the entire algorithm and calculate the mᵒ⁽¹⁾ term more precisely. Finally, we conclude with potential directions for future work in this area.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections