AIRCC's International Journal of Computer Science and Information Technology

Open Access Open Access  Restricted Access Subscription Access

On the Implementation of Goldberg's Maximum flow Algorithm in Extended Mixed Network


Affiliations
1 University of Danang, Danang, Viet Nam
2 Vinaphone of Danang, Viet Nam
3 College of Transport II, Ministry of Transport, Viet Nam
 

In this paper, we solve this problem of finding maximum flow in extended mixed network by Revised preflow-push methods of Goldberg This algorithm completely different algorithm postflow-pull in [15]. However, we share some common theory with [15].

Keywords

Algorithm, Maximum Flow, Extended Mixed Network, Preflow, Excess.
User
Notifications
Font Size


  • On the Implementation of Goldberg's Maximum flow Algorithm in Extended Mixed Network

Abstract Views: 478  |  PDF Views: 179

Authors

Nguyen Dinh Lau
University of Danang, Danang, Viet Nam
Tran Quoc Chien
University of Danang, Danang, Viet Nam
Phan Phu Cuong
Vinaphone of Danang, Viet Nam
Le Hong Dung
College of Transport II, Ministry of Transport, Viet Nam

Abstract


In this paper, we solve this problem of finding maximum flow in extended mixed network by Revised preflow-push methods of Goldberg This algorithm completely different algorithm postflow-pull in [15]. However, we share some common theory with [15].

Keywords


Algorithm, Maximum Flow, Extended Mixed Network, Preflow, Excess.

References