A parallel blocking flow algorithm for acyclic networks

DOI10.1016/0196-6774(92)90051-DMaRDI QIDQ4020359zbMATH OpenOpenAlexFDO

Authors Uzi Vishkin

Publication date 16 January 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90051-d

zbMATH Keywords

blocking flowdirected acyclic networkparallel method

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A parallel algorithm for finding a blocking flow in an acyclic network
• More efficient parallel flow algorithms
• A new approach to the maximum-flow problem
• A fast parallel algorithm for minimum-cost small integral flows
• Efficient parallel algorithms for the minimum cost flow problem

Cited in

(6)

• The parallel complexity of finding a blocking flow in a 3-layer network
• A parallel algorithm for finding a blocking flow in an acyclic network
• Parallel Algorithms for Zero-One Supply-Demand Problems
• scientific article; zbMATH DE number 5060433 (Why is no real title available?)
• The complexity of node blocking for dags
• More efficient parallel flow algorithms

This page was built for publication: A parallel blocking flow algorithm for acyclic networks

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