Sequential and parallel algorithms for minimum flows.

DOI10.1007/BF02935746MaRDI QIDQ1880468zbMATH OpenOpenAlexFDO

Authors Eleonor Ciurea, Laura Ciupală

Publication date 28 September 2004

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02935746

zbMATH Keywords

network flowparallel algorithmsnetwork algorithmsminimum flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Recommendations

• A new approach to the maximum-flow problem
• Efficient parallel algorithms for the minimum cost flow problem
• More efficient parallel flow algorithms
• Minimum flows in unit capacity networks
• Parallel primal-dual methods for the minimum cost flow problem

Cites work

• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• A Fast and Simple Algorithm for the Maximum Flow Problem
• A new approach to the maximum-flow problem
• A parallel algorithm for finding a blocking flow in an acyclic network
• An O(n2log n) parallel max-flow algorithm
• Improved Time Bounds for the Maximum Flow Problem
• Network flows. Theory, algorithms, and applications.
• Processor-efficient implementation of a maximum flow algorithm
• Some Recent Advances in Network Flows

Cited in

(14)

• Minimum flow problem on network flows with time-varying bounds
• A new approach for computing a most positive cut using the minimum flow algorithms
• A polynomial time algorithm for the minimum flow problem in time-varying networks
• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Price of anarchy and price of stability in multi-agent project scheduling
• Totally unimodular multistage stochastic programs
• Inverse minimum flow problem
• Solving the minimum flow problem with interval bounds and flows
• Parallel algorithms for the maximum flow problem with minimum lot sizes
• An alternate linear algorithm for the minimum flow problem
• Uncertain minimum cost flow problem
• Another note on Dilworth's decomposition theorem.
• The inverse maximum flow problem consideringl_∞norm
• Efficient parallel algorithms for the minimum cost flow problem

This page was built for publication: Sequential and parallel algorithms for minimum flows.

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