A highest-label preflow algorithm for the minimum flow problem

Authors:
Laura Ciupala;Eleonor Ciurea
Affiliations:
University Transilvania of Brasov, Department of Computer Science, Brasov, Romania;University Transilvania of Brasov, Department of Computer Science, Brasov, Romania
Venue:
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Year:
2007

Citing 2
Cited 7

Sequential and parallel algorithms for minimum flows

The Korean Journal of Computational & Applied Mathematics
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications

About preflow algorithms for the minimum flow problem

WSEAS Transactions on Computer Research
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
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [7]. It examines always an active node with the highest distance label and runs in O(n2√m) time.