Formalized Methods Of Paralleling The Goldberg-tarjan Algorithm

摘要

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.