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 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.
によって引用された
-
Andon P.I., Doroshenko A.Yu., Zhereb K.A., Yatsenko O.A, Algebra-Algorithmic Models and Methods of Parallel Programing, 2018. Crossref
662 記事の閲覧数
5 記事のダウンロード
記事の統計
類似内容の記事:
最新号
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020