Optimization Online


A Fast Max Flow Algorithm

Xiao-yue Gong( xygong***at***mit.edu)
James Orlin(jorlin***at***mit.edu)

Abstract: In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm was the fastest for very sparse graphs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan. We describe a new variant of the excess scaling algorithm for the max flow problem whose running time strictly dominates the running time of the algorithm by King, Rao, and Tarjan.

Keywords: maximum flow algorithm, network flows

Category 1: Network Optimization

Category 2: Combinatorial Optimization (Graphs and Matroids )

Citation: Technical report. MIT Sloan School and Operations Research Center, Cambridge, MA. July, 2018.

Download: [PDF]

Entry Submitted: 08/01/2018
Entry Accepted: 08/01/2018
Entry Last Modified: 08/01/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society