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
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing
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
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
Minimum flows in bipartite networks with unit capacities
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Improved algorithm for minimum flows in bipartite networks with unit capacities
WSEAS Transactions on Computers
WSEAS Transactions on Computers
| Hi-index | 0.00 |
In this paper, we develop a parallel implementation of the deficit scaling algorithm for minimum flow in bipartite networks. This algorithm performs a pull from an active node with a large deficit and with the smallest distance label from N1 at a time followed by pulls from several nodes in N2 in parallel. It runs in O(n12 log C log p) time using p = ⌈m/n1⌉ processors.