We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

The Max Flow Algorithm of Dinis and Karzanov: An Exposition

Thumbnail Image
Download
Name

MIT-LCS-TM-080.pdf

Size

2.31 MB

Format

Adobe PDF

Checksum (MD5)

8b165649a78dccf2d99f52465a9d6515

Author(s)
Even, Shimon
Date Issued
December 1976
Series/Report no.
MIT-LCS-TM-080
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.