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.