Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

The Minimum Flows in Bipartite Dynamic Networks. The Static Approach

Abstract : In this paper we study minimum flow algorithms for bipartite dynamic networks. We resolve this problem by rephrasing into a problem in bipartite static network. In a bipartite static network the several minimum flow algorithms can be substantially improved. The basic idea in this improvement is a two arcs pull rule. In the final of the paper we present an example. Keywords: bipartite dynamic network flow, minimum flow, bipartite static network flow.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Camelia Schiopu Connect in order to contact the contributor
Submitted on : Tuesday, January 19, 2016 - 6:09:17 PM
Last modification on : Tuesday, January 19, 2016 - 6:17:48 PM
Long-term archiving on: : Wednesday, April 20, 2016 - 1:01:30 PM


Files produced by the author(s)


  • HAL Id : hal-01259024, version 1


E Ciurea, C Schiopu. The Minimum Flows in Bipartite Dynamic Networks. The Static Approach. 2016. ⟨hal-01259024⟩



Record views


Files downloads