Construction and Analysis of Network Flow Problem Which Forces Karzanov Algorithm 0(n^3) Running Time
| dc.contributor.author | Baratz, Alan E. | en_US |
| dc.date.accessioned | 2023-03-29T14:08:04Z | |
| dc.date.available | 2023-03-29T14:08:04Z | |
| dc.date.issued | 1977-05 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148911 | |
| dc.description.abstract | The intest of this paper is to demonstrate the construction of a network flow problem which will force the Karzanov "Preflow" algorithm to run in its theoretic worst case time 0(n^3). Once such a "bad case" network has been constructed, an analysis is performed to determine the exact time required by the algorithm to computer the maximum flow through the network. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-083 | |
| dc.title | Construction and Analysis of Network Flow Problem Which Forces Karzanov Algorithm 0(n^3) Running Time | en_US |
| dc.identifier.oclc | 3299568 |
