Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows.
Norman ZadehPublished in: J. ACM (1972)
Keyphrases
- detection algorithm
- theoretical analysis
- np hard
- expectation maximization
- experimental evaluation
- dynamic programming
- computational complexity
- matching algorithm
- preprocessing
- k means
- optimal solution
- times faster
- memory usage
- path planning
- optimization algorithm
- lower bound
- worst case
- similarity measure
- estimation algorithm
- improved algorithm
- data sets
- network flow
- ant colony optimization
- segmentation algorithm
- linear programming
- computational cost
- data structure
- image segmentation
- genetic algorithm