Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have