Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

SEQUENTIAL AND PARALLEL ALGORITHMS FOR MINIMUM FLOWS

  • Ciurea, Eleonor (Department of Computer Science Transilvania University) ;
  • Ciupala, Laura (Department of Computer Science Transilvania University)
  • Published : 2004.05.01

⟨ Previous Next ⟩

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.

Keywords

References

  1. Network Flows. Theory, algorithms and applications R. Ahuja;T. Magnanti;J. Orlin
  2. SIAM Review v.33 Some Recent Advances in Network Flows R. Ahuja;T. Magnanti;J. Orlin
  3. Operation Research v.37 A Fast and Simple Algorithm for the Maximum Flow Problem R. Ahuja;J. Orlin
  4. SIAM Journal of Computing v.18 Improved Time Bounds for the Maximum Flow Problem R. Ahuja;J. Orlin;R. Tarjan
  5. Information Processing Letters v.38 Processor-efficient implementation of a maximum flow algorithm A. V. Goldberg
  6. A New Max-Flow Algorithm A. V. Goldberg
  7. Journal of ACM v.35 A New Approach to the Maximum Flow Problem A. V. Goldberg;R. E. Tarjan
  8. Information Processing Letters v.31 A Parallel Algorithm for Fin ding a Blocking Flow in on Acyclic Network A. V. Goldberg;R. E. Tarjan
  9. Soviet. Math. Dokl. v.15 Determining the Maximum Flow in a Network by the Method of Preflows A. V. Karzanov
  10. J. Algorithms v.3 An O($n^2$log n) parallel max-flow algorithm Y. Shiloach;U. Vishkin