The maximum ows in bipartite dynamic networks. The static approach

Camelia Schiopu


In this paper we study maximum flow algorithms for bipartite dynamic networks. We resolve this problem by rephrasing into a problem in bipartite static network. In a bipartite static network several maximum flow algorithms can be substantially improved. The basic idea in this improvement is a two arcs push rule. At the end of the article we present an example.

Full Text: