RECENT DEVELOPMENTS IN MAXIMUM FLOW ALGORITHMS

Takao Asano, Yasuhito Asano
2000 Journal of the Operations Research Society of Japan  
Goldberg and Rao recelltly proposed the blocking flow methodbased on a binary length function to obtain a better algorithm for the maximllm fiow problem. The previous algorithms based on the blocking flow methed proposed by Dinic use the unit length function: every residual edge is of length 1. In this paper, we survey properties of the distance function defined by a length function and give am overvieur on the representative maxirmim fiow algorithrms proposed so far in asysternatic way by
more » ... zing these properties. Among them are included two new algorithms: the Goldberg-Rao algorithm which finds a maximum fiow on an integral capacity network N of n vertices amd m edges in O(min{mi/2, n2/3}m log(n2/m) log U) tinie, where
doi:10.15807/jorsj.43.2 fatcat:cvaf6u4v45gkdmwlgems7ewbbi