An algorithm for minimum flows

Authors:
Oana Georgescu;Eleonor Ciurea
Affiliations:
Transilvania University of Brasov, Department of Computer Science, Romania;Transilvania University of Brasov, Department of Computer Science, Romania
Venue:
WSEAS Transactions on Computers
Year:
2008

Citing 9
Cited 0

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
About preflow algorithms for the minimum flow problem

WSEAS Transactions on Computer Research
Combinatorial optimization: mutual relations among graph algorithms

WSEAS Transactions on Mathematics
Decreasing path algorithm for minimum flows: dynamic tree implementations

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider an advanced topic for minimum flow problem: the use of the dynamic trees data structure to efficiently implement decreasing path algorithm. In the final part of the paper we present an example for this algorithm, some practical applications for the minimum flow problem, conclusions and open problems.