On the theoretical efficiency of various network flow algorithms

DOI10.1016/0304-3975(81)90008-6zbMath0464.68044OpenAlexW2085038198MaRDI QIDQ1154258

Zvi Galil

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90008-6

zbMATH Keywords

upper boundsmaximum flow problemnetwork flow algorithms

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Maximal Flow Through a Network
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Network Flow and Testing Graph Connectivity
• Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows

This page was built for publication: On the theoretical efficiency of various network flow algorithms