Two Flow Problems in Dynamic Networks
Camelia Șchiopu, Eleonor Ciurea · International Journal of Computers Communications & Control · 2016
In this paper we study two flow problems: the feasible flow problem in dynamic networks and the maximum flow problem in bipartite dynamic networks with lower bounds. We mention that the maximum flow problem in bipartite dynamic networks with lower bound was presented in paper [8]a. For these problems we give examples.