A parallel realization of the Edmonds-Karp algorithm

MaRDI QIDQ3608058zbMATH OpenFDO

Authors S. D. Pogorilyj, A. D. Gusarov

Publication date 28 February 2009

zbMATH Keywords

algorithmic algebraEdmonds-Karp algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Paralleling of Edmonds-Karp network flow algorithm
• An approach to the parallel solution of a high-dimensional basic flow problem
• Formalizing the Edmonds-Karp algorithm
• More efficient parallel flow algorithms
• Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors

Cited in

(4)

• An approach to the parallel solution of a high-dimensional basic flow problem
• Formalizing the Edmonds-Karp algorithm
• Formal methods of paralleling the Tarjan algorithm
• Paralleling of Edmonds-Karp network flow algorithm

This page was built for publication: A parallel realization of the Edmonds-Karp algorithm

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