A fast parallel max-flow algorithm
Authors:
- Yossi PeretzYPYossi Peretz
- Yigal FischlerYFYigal Fischler
- 16 July 2022
- journal article
- research article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 169, 226-241
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An experimental comparison of min-cut/max- flow algorithms for energy minimization in visionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First SearchTheory of Computing Systems, 2001
- Thought experiments in science education: potential and current realizationInternational Journal of Science Education, 2000
- A Faster Deterministic Maximum Flow AlgorithmJournal of Algorithms, 1994
- The binary network flow problem is logspace complete for PTheoretical Computer Science, 1990
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- An improved parallel algorithm that computes the BFS numbering of a directed graphInformation Processing Letters, 1988
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982