The maximum adjacency-ordering max-flow algorithm was reviewed. It was shown that the algorithm was not strongly polynomial by giving a real-valued instance for which the algorithm does not terminate. The fact that a strongly polynomial algorithm terminated in finite time even for instances with irrational data was used.
ASJC Scopus subject areas
- 経営科学およびオペレーションズ リサーチ