An O(V^5/3E^2/3) algorithm for the maximal flow problem

DOI10.1007/BF00264254MaRDI QIDQ1151034zbMATH OpenFDO

Authors Zvi Galil

Publication date 1980

Published in Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Cites work

• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• On the theoretical efficiency of various network flow algorithms
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(11)

• On the efficiency of maximum-flow algorithms on networks with small integer capacities
• Worst case behavior of the Dinic algorithm
• A new Karzanov-type O(n^ 3) max-flow algorithm
• A parallel algorithm for finding a blocking flow in an acyclic network
• Computational investigations of maximum flow algorithms
• Local optima topology for the \(k\)-coloring problem
• ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
• A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
• A simple version of Karzanov's blocking flow algorithm
• The maximum flow problem: A max-preflow approach

This page was built for publication: An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem

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