An O(|V|³) Algorithm for Finding Maximum Flows in Networks.
Vishv M. MalhotraM. Pramodh KumarS. N. MaheshwariPublished in: Inf. Process. Lett. (1978)
Keyphrases
- objective function
- preprocessing
- significant improvement
- dynamic programming
- experimental evaluation
- selection algorithm
- tree structure
- learning algorithm
- detection algorithm
- optimal solution
- theoretical analysis
- neural network
- optimization algorithm
- particle swarm optimization
- high accuracy
- genetic algorithm
- image registration
- worst case
- np hard
- simulated annealing
- k means
- lower bound
- segmentation algorithm
- computational complexity
- social networks
- matching algorithm
- complex networks
- data sets
- estimation algorithm