A fast maximum flow algorithm

James B. Orlin, Xiao-Yue GongNetworks 2021 · OpenReview

Abstract

In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was n...
BibTeX
@inproceedings{orlin2021fast,
  author = {James B. Orlin and Xiao-Yue Gong},
  title = {{A fast maximum flow algorithm}},
  booktitle = {Networks},
  year = {2021},
  url = {https://openreview.net/forum?id=ZtT-riLxSPh},
}

Loading related content...

Figure