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

DOI10.1016/0305-0548(92)90017-YzbMath0758.90031MaRDI QIDQ1195105

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)

Cites Work

• Unnamed Item
• 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