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

DOI10.1016/0304-3975(95)00022-OzbMath0873.68159OpenAlexW2064332653WikidataQ56092053 ScholiaQ56092053MaRDI QIDQ672389

Uri Zwick

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00022-o

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Budget-feasible mechanisms for proportionally selecting agents from groups ⋮ Simplifying maximum flow computations: the effect of shrinking and good initial flows ⋮ Formalizing network flow algorithms: a refinement approach in Isabelle/HOL ⋮ Formalizing the Edmonds-Karp Algorithm ⋮ Paths to stable allocations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate