All minimum flows in networks

Authors:
Laura Ciupală;Eleonor Ciurea
Affiliations:
Department of Computer Science, University Transilvania of Braşov, Braşov, Romania;Department of Computer Science, University Transilvania of Braşov, Braşov, 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 3
Cited 0

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
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a method for determining all the minimum flows in a given network. The minimum flow algorithms developed until now determine only a minimum flow, but, usually, there is more than one minimum flow in a network. There are several applications that can be modeled as minimum flow problems in some networks and solved by determining all the minimum flows in those networks. This is the main reason for which we focus on the problem of determining all minimum flows in networks. This problem also arises as a subproblem when solving more complex network flows problems, for instance when solving inverse flow problems.