On the theoretical efficiency of various network flow algorithms

DOI10.1016/0304-3975(81)90008-6MaRDI QIDQ1154258zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Maximal Flow Through a Network
• Network Flow and Testing Graph Connectivity
• Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(1)

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

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

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