Sequential and parallel algorithms for minimum flows

Authors:
Eleonor Ciurea;Laura Ciupală
Affiliations:
Department of Computer Science Transilvania University 50, Iuliu Maniu 2200 Braşov, Romania;Department of Computer Science Transilvania University 50, Iuliu Maniu 2200 Braşov, Romania
Venue:
The Korean Journal of Computational & Applied Mathematics
Year:
2004

Citing 7
Cited 14

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
A parallel algorithm for finding a blocking flow in an acyclic network

Information Processing Letters
Improved time bounds for the maximum flow problem

SIAM Journal on Computing
Some recent advances in network flows

SIAM Review
Processor-efficient implementation of a maximum flow algorithm

Information Processing Letters
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications

A highest-label preflow algorithm for the minimum flow problem

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
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
Minimum flows in bipartite networks

MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
Minimum flows in bipartite networks with unit capacities

ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
About flow problems in networks with node capacities

WSEAS Transactions on Computers
Improved algorithm for minimum flows in bipartite networks with unit capacities

WSEAS Transactions on Computers
Partitioning preflow-pull algorithm for the parametric network flow problem: a linguistic rule-based constraints optimisation approach

NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
All minimum flows in networks

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Balancing algorithm for the minimum flow problem in parametric bipartite networks

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I

Quantified Score

Hi-index	0.00

Visualization

Abstract

First, we present two classes of sequential algorithms for minimum flow problem: decreasing path algorithms and preflow algorithms. Then we describe another approach of the minimum flow problem, that consists of applying any maximum flow algorithm in a modified network. In section 5 we present several parallel preflow algorithms that solve the minimum flow problem. Finally, we present an application of the minimum flow problem.