| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [9 references]
https://hal.inria.fr/hal-01259024
Contributor : Camelia Schiopu <>
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
Contributor : Camelia Schiopu <>
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
File
Paper_Schiopu_Ciurea.pdf
Files produced by the author(s)