The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate

Research output: Contribution to journalArticlepeer-review

Abstract

It is widely known that the Ford-Fulkerson procedure for finding the maximum flow in a network need not terminate if some of the capacities of the network are irrational. Ford and Fulkerson gave as an example a network with 10 vertices and 48 edges on which their procedure may fail to halt. We construct much smaller and simpler networks on which the same may happen. Our smallest network has only 6 vertices and 8 edges. We show that it is the smallest example possible.

Original languageEnglish
Pages (from-to)165-170
Number of pages6
JournalTheoretical Computer Science
Volume148
Issue number1
DOIs
StatePublished - 21 Aug 1995

Fingerprint

Dive into the research topics of 'The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate'. Together they form a unique fingerprint.

Cite this