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 Complexity of the Maximum Network Flow Problem

Thumbnail Image
Download
Name

MIT-LCS-TR-230.pdf

Size

1.5 MB

Format

Adobe PDF

Checksum (MD5)

79788c74c85e5e695967369d3aa8a1d9

Author(s)
Baratz, Alan Edward
Advisor(s)
Rivest, Ronald L.
Date Issued
March 1980
Series/Report no.
MIT-LCS-TR-230
Abstract
This thesis deals with the computational complexity of the maximum network flow problem. We first introduce the basic concepts and fundamental theorems upon which the study of "max-flow" has been built. We then trace the development of max-flow algorithms from the original "labeling algorithm" of Ford and Fulkerson, through a recent 0 (V-E-log 2 V) algorithm due to Galil and Naamad.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.