Balancing algorithm for the minimum flow problem in parametric bipartite networks

Authors:
Eleonor Ciurea;Mircea Parpalea
Affiliations:
Department of Computer Science, Transilvania University of Brasov, Brasov, Romania;National College "Andrei Saguna", Brasov, Romania
Venue:
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Year:
2010

Citing 5
Cited 0

A fast parametric maximum flow algorithm and applications

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
Balancing applied to maximum network flow problems

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14

Quantified Score

Hi-index	0.00

Visualization

Abstract

The algorithm presented in this paper solves the minimum flow problem for a special parametric bipartite network. The algorithm does not work directly in the original network but in the parametric residual network and finds a particular state of the residual network from which the minimum flow and the maximum cut for any of the parameter values are obtained. The approach implements a round-robin algorithm looping over a list of nodes until an entire pass ends without any change of the flow.