Fast algorithms for bipartite network flow
SIAM Journal on Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Graph theory and its applications
Graph theory and its applications
Network Models in Optimization and Their Applications in Practice
Network Models in Optimization and Their Applications in Practice
Sequential and parallel algorithms for minimum flows
The Korean Journal of Computational & Applied Mathematics
Combinatorial optimization: mutual relations among graph algorithms
WSEAS Transactions on Mathematics
Sequential and parallel deficit scaling algorithms for minimum flow in bipartite networks
WSEAS Transactions on Computers
A parallel algorithm for the minimum flow problem in bipartite networks
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Decreasing path algorithm for minimum flows: dynamic tree implementations
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Graphs, Networks and Algorithms
Graphs, Networks and Algorithms
Minimum flows in bipartite networks
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
| Hi-index | 0.00 |
The theory and applications of network flows is probabily the most important single tool for applications of digraphs and perhaps even of graphs as a whole. In this paper we study minimum flow an algorithm in bipartite networks with unit capacities combining an algorithm for minimum flow in bipartite networks with an algorithm for minimum flow in unit capacity networks. Finally, we present the applications of the minimum flow problem in bipartite networks with unit capacities.