Construction and Analysis of Network Flow Problem Which Forces Karzanov Algorithm 0(n^3) Running Time
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 e...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148911 |