The Max Flow Algorithm of Dinis and Karzanov: An Exposition
| dc.contributor.author | Even, Shimon | en_US |
| dc.date.accessioned | 2023-03-29T14:07:51Z | |
| dc.date.available | 2023-03-29T14:07:51Z | |
| dc.date.issued | 1976-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148908 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-080 | |
| dc.title | The Max Flow Algorithm of Dinis and Karzanov: An Exposition | en_US |
| dc.identifier.oclc | 3195295 |
