Minimum flows in bipartite networks
Eleonor Ciurea, Oana Georgescu, Daniela Marinescu · International Conference on Mathematical and Computational Methods in Science and Engineering · 2008
We present two classes of algorithms for finding minimum flow in bipartite networks. The time bounds for several minimum flow algorithms automatically improve when the algorithms are applied without modification on bipartite networks. We obtain further running time improvements by modifying the algorithms. This modification applies only to preflow algorithms.