Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning

DOI10.1016/0305-0548(92)90017-YMaRDI QIDQ1195105zbMATH OpenFDO

Authors Steve Corder, Kwang C. Shin

Publication date 5 October 1992

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

maximum flow problemfixed-order scanningFord-Fulkerson labelingshortest flow augmenting paths

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A new approach to the maximum-flow problem
• scientific article; zbMATH DE number 515923
• A Fast and Simple Algorithm for the Maximum Flow Problem
• The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
• Simplifications and speedups of the pseudoflow algorithm

Cites work

• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Maximal Flow Through a Network
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning

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