Доступ предоставлен для: Guest
Journal of Automation and Information Sciences

Выходит 12 номеров в год

ISSN Печать: 1064-2315

ISSN Онлайн: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Formalized Methods of Paralleling the Goldberg−Tarjan Algorithm

Том 40, Выпуск 9, 2008, pp. 64-75
DOI: 10.1615/JAutomatInfScien.v40.i9.60
Get accessGet access

Краткое описание

We describe the transformation of the Goldberg−Tarjan algorithm, which solves the significant network problem of finding the maximum flow in an oriented graph. The concept of its parallel realization and the corresponding scheme of the algorithm, using the mathematical apparatus of the modified systems of the Glushkov algorithmic algebras, are formed. Two optimized schemes of the algorithm are obtained.

ЦИТИРОВАНО В
  1. Andon P.I., Doroshenko A.Yu., Zhereb K.A., Yatsenko O.A, Algebra-Algorithmic Models and Methods of Parallel Programing, 2018. Crossref

Портал Begell Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции Цены и условия подписки Begell House Контакты Language English 中文 Русский Português German French Spain