Decreasing path algorithm for minimum flows: dynamic tree implementations

Authors:
Oana Georgescu;Eleonor Ciurea
Affiliations:
Transilvania University of Brasov, Department of Computer Science, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Brasov, Romania
Venue:
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Year:
2008

Citing 6
Cited 4

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A data structure for dynamic trees

Journal of Computer and System Sciences
Improved time bounds for the maximum flow problem

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

Network flows: theory, algorithms, and applications
Sequential and parallel algorithms for minimum flows

The Korean Journal of Computational & Applied Mathematics
A highest-label preflow algorithm for the minimum flow problem

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers

An algorithm for minimum flows

WSEAS Transactions on Computers
Minimum flows in bipartite networks

MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
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 an algorithm for finding minimum flow in networks with arcs capacities using the dynamic tree implementation. As a final part, we present an example for this algorithm.