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
A maximum flow algorithm using MA ordering
Operations Research Letters
Sequential and parallel deficit scaling algorithms for minimum flow in bipartite networks
WSEAS Transactions on Computers
An algorithm for minimum flows
WSEAS Transactions on Computers
The wave preflow algorithm for the minimum flow problem
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
About flow problems in networks with node capacities
WSEAS Transactions on Computers
| Hi-index | 0.00 |
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 Ciupala in [8], obtained by imposing in the generic preflow algorithm the rule that the algorithm must always select an active node with the highest distance label. Our new algorithm runs in O(n2m1/2) time, which is substantially better than the running time of the generic preflow algorithm, that is O(n2m). Moreover, the highest-label preflow algorithm is the fastest polynomial algorithm for minimum flow problem.