Sequential and Parallel Algorithm by Postflow-Pull Methods to Find Maximum Flow

Abstract

The problem of finding maximum flow in network graph is extremely interesting and practically applicable in many fields in our daily life, especially in transportation. Therefore, a lot of researchers have been studying this problem in various methods. In this paper, we offer a different method to solve this problem that is the postflow-pull method with complexity equal to complexity used pre-flow push by A. Goldberg and R.E. Tarjan 1986. In addition, to take more advantage of multi-core architecture of the parallel computing system, we build this algorithm on multiple processors. This is a completely new method not being announced in the world. The results of this paper are basically systematized and proven. The idea of this algorithm is using multi processors to work in parallel by postflow-pull alogrithm. Among these processors, there is one main processor managing data, sending data to the sub processors, receiving data from the sub-processors. The sub-processors simultaneously execute their work and send their data to the main processor until the job is finished, the main processor will show the results of the problem.

DOI: 10.1109/ICCSA.2013.36

1 Figure or Table

Cite this paper

@article{Quoc2013SequentialAP, title={Sequential and Parallel Algorithm by Postflow-Pull Methods to Find Maximum Flow}, author={Chien Tran Quoc and Lau Nguyen Dinh and Trinh Nguyen Thi Tu}, journal={2013 13th International Conference on Computational Science and Its Applications}, year={2013}, pages={178-181} }