Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Nguyen Dinh Lau"'
Autor:
Nguyen Dinh Lau
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].
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b38aa5761ee30b253cb275868357abc
Autor:
Nguyen Dinh Lau, Tran Quoc Chien
Publikováno v:
International journal of Computer Networks & Communications. 9:57-67
Autor:
Nguyen Dinh Lau
Publikováno v:
SSRN Electronic Journal.
This study builds up two parallel algorithms to improve computing performance for two listing binary and listing permutation algorithms. The problems are extremely interesting and practically applicable in many fields in our daily life. To parallel e