Sequential and parallel algorithms for minimum flows

Article

Abstract

First, we present two classes of sequential algorithms for minimum flow problem: decreasing path algorithms and preflow algorithms. Then we describe another approach of the minimum flow problem, that consists of applying any maximum flow algorithm in a modified network. In section 5 we present several parallel preflow algorithms that solve the minimum flow problem. Finally, we present an application of the minimum flow problem.

AMS Mathematics Subject Classification

90B10 90C35 05C35 68R10 

Key words and phrases

Network flow network algorithms minimum flow problem parallel algorithms 

Copyright information

© Korean Society for Computational and Applied Mathematics 2004

Authors and Affiliations

  1. 1.Department of Computer Science Transilvania University 50Bra§ovRomania

Personalised recommendations