A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
Mathematics of Operations Research
Sequential and parallel algorithms for minimum flows
The Korean Journal of Computational & Applied Mathematics
A highest-label preflow algorithm for the minimum flow problem
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
About preflow algorithms for the minimum flow problem
WSEAS Transactions on Computer Research
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Network information flow with correlated sources
IEEE Transactions on Information Theory
A maximum flow algorithm using MA ordering
Operations Research Letters
About flow problems in networks with node capacities
WSEAS Transactions on Computers
| Hi-index | 0.00 |
In this paper, we develop the wave preflow algorithm for minimum flow. This algorithm is a special implementation of the generic preflow algorithm developed by Ciurea and Ciupala in [11]. It is a hybrid between the FIFO preflow algorithm and the highest-label preflow algorithm for minimum flow. It examines the active nodes in nondecreasing order of their distance labels and the node examination terminates when either the node deficit becomes zero or the node is relabeled. The wave preflow algorithm for minimum flow runs in O(n3) time.