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

DOI10.1007/S10559-009-9099-ZMaRDI QIDQ1040389zbMATH OpenOpenAlexFDO

Authors S. D. Pogorilyy, Yu. V. Boyko, A. D. Gusarov, S. I. Lozytskyi

Publication date 24 November 2009

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-009-9099-z

zbMATH Keywords

data parallelismdistributed systemformalization of algorithmsparallel scheme of an algorithmsystem of algorithmic algebras

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Distributed systems (68M14) Parallel algorithms in computer science (68W10)

Recommendations

• Paralleling of Edmonds-Karp network flow algorithm
• A parallel realization of the Edmonds-Karp algorithm
• scientific article; zbMATH DE number 1552018
• scientific article; zbMATH DE number 515934
• scientific article; zbMATH DE number 1538873

Cites work

• scientific article; zbMATH DE number 5345050 (Why is no real title available?)
• Maximal Flow Through a Network
• Paralleling of Edmonds-Karp network flow algorithm
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(4)

• Multidimensional max-flow method and its application for plastic analysis
• A parallel realization of the Edmonds-Karp algorithm
• A parallel algorithm for computing the flow complex
• Paralleling of Edmonds-Karp network flow algorithm

This page was built for publication: An approach to the parallel solution of a high-dimensional basic flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040389)