The Complexity of the Maximum Network Flow Problem
| dc.contributor.advisor | Rivest, Ronald L. | en_US |
| dc.contributor.author | Baratz, Alan Edward | en_US |
| dc.date.accessioned | 2023-03-29T15:03:44Z | |
| dc.date.available | 2023-03-29T15:03:44Z | |
| dc.date.issued | 1980-03 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149513 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-230 | |
| dc.title | The Complexity of the Maximum Network Flow Problem | en_US |
| dc.identifier.oclc | 06216868 |
