An approach to the parallel solution of a high-dimensional basic flow problem

Authors:
S. D. Pogorilyy;Yu. V. Boyko;A. D. Gusarov;S. I. Lozytskyi
Affiliations:
Taras Shevchenko State University, Kiev, Ukraine;Taras Shevchenko State University, Kiev, Ukraine;Taras Shevchenko State University, Kiev, Ukraine;Taras Shevchenko State University, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2009

Citing 2
Cited 0

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Distributed Systems: Principles and Paradigms (2nd Edition)

Distributed Systems: Principles and Paradigms (2nd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The body of mathematics of modified systems of algorithmic algebras (SAA-M) is used to formalize the Edmonds---Karp algorithm of finding the maximum flow in a network. With allowance made for the distributed system features that are usually used for solving complicated problems, optimization criteria are formulated and used to obtain parallel SAA-M-schemes.