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

Uri Zwick

doi:10.1016/0304-3975(95)00022-O

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

Uri Zwick^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

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 language	English
Pages (from-to)	165-170
Number of pages	6
Journal	Theoretical Computer Science
Volume	148
Issue number	1
DOIs	https://doi.org/10.1016/0304-3975(95)00022-O
State	Published - 21 Aug 1995

Access to Document

10.1016/0304-3975(95)00022-O

Cite this

@article{95157e38ac4f4fceb8160bd7874a2788,

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

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.",

author = "Uri Zwick",

year = "1995",

month = aug,

day = "21",

doi = "10.1016/0304-3975(95)00022-O",

language = "אנגלית",

volume = "148",

pages = "165--170",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

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

AU - Zwick, Uri

PY - 1995/8/21

Y1 - 1995/8/21

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33750737809&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(95)00022-O

DO - 10.1016/0304-3975(95)00022-O

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33750737809

SN - 0304-3975

VL - 148

SP - 165

EP - 170

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this