The Simplest and Smallest Network on Which the Ford-Fulkerson Maximum Flow Procedure May Fail to Terminate

Toshihiko Takahashi. The Simplest and Smallest Network on Which the Ford-Fulkerson Maximum Flow Procedure May Fail to Terminate. JIP, 24(2):390-394, 2016. [doi]

Abstract

Abstract is missing.