Minimum flows in bipartite networks

Authors:
Eleonor Ciurea;Oana Georgescu;Daniela Marinescu
Affiliations:
Transilvania University of Brasov, Department of Computer Science, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Brasov, Romania
Venue:
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
Year:
2008

Citing 5
Cited 3

Fast algorithms for bipartite network flow

SIAM Journal on Computing
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Improved Algorithms for Bipartite Network Flow

SIAM Journal on Computing
Sequential and parallel algorithms for minimum flows

The Korean Journal of Computational & Applied Mathematics
Decreasing path algorithm for minimum flows: dynamic tree implementations

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers

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
A study on the feasibility of the inverse maximum flow problems and flow modification techniques in the case of non-feasibility

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two classes of algorithms for finding minimum flow in bipartite networks. The time bounds for several minimum flow algorithms automatically improve when the algorithms are applied without modification on bipartite networks. We obtain further running time improvements by modifying the algorithms. This modification applies only to preflow algorithms.