A highest-label preflow algorithm for the minimum flow problem
Laura Ciupală, Eleonor Ciurea · 2007
Abstract: In this paper, we describe the highest-label preflow algorithm for minimum flow. This algorithm is a special implementation of the generic preflow algorithm developed by Ciurea and Ciupală in [7]. It examines always an active node with the highest distance label and runs in O(n 2 √ m) time. Key–Words: Network flow; Network algorithms; Minimum flow problem 1