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

DOI10.1016/0304-3975(95)00022-OzbMATH Open0873.68159OpenAlexW2064332653WikidataQ56092053 ScholiaQ56092053MaRDI QIDQ672389FDOQ672389

Authors: 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

Recommendations

• Transfinite Ford-Fulkerson on a finite network
• On the efficiency of maximum-flow algorithms on networks with small integer capacities
• scientific article; zbMATH DE number 1102865
• Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
• Minimum flows in unit capacity networks

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672389)