A New Algorithm for the Maximal Flow Problem

A new algorithm for finding the maximal flow in a given network is presented. The algorithm runs in time O(V5/3E2/3) or O(n2. 33) where n = V + E is the length of the input.

Authors

• Zvi Galil

Keywords

• Computer science
• Complexity theory
• History
• Mathematics
• Law
• Legal factors
• Integral equations
• Maximum Flow
• Input Length
• Network Layer
• Original Algorithm
• Reconnection
• Specific Layer
• Amount Of Flow
• Previous Algorithms
• Standardized Path
• Consecutive Layers
• Edge List
• Small Edge
• Kind Of Flow
• Open Path
• Open Edges
• Conservative Rule