A shortest augmenting path method for solving minimal perfect matching problems.
Ulrich DerigsPublished in: Networks (1981)
Keyphrases
- alternative methods
- preprocessing
- combinatorial optimization
- matching algorithm
- algebraic equations
- computational complexity
- detection method
- objective function
- cost function
- high accuracy
- high precision
- clustering method
- constraint satisfaction problems
- graph matching
- image matching
- pattern matching
- data sets
- np complete
- significant improvement
- reinforcement learning
- similarity measure
- neural network