The Max Flow Algorithm of Dinis and Karzanov: An Exposition

Abstract

Recently A.V. Karzanov improved Dinic's algorithm to run in time 0(n^3) for networks of n vertices. For the benefit of those who do not read Russian, the Dinic-Karzanov algorithm is explained and proved. In addition to being the best algorithm known for network flow, this algorithm is unique in that it does not use path augmentation.