Graph matching problems and the NP-hardness of sortedness constraints.
Irena RusuPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- np hardness
- graph matching
- np hard
- mixed integer
- error tolerant
- object recognition
- graph matching algorithm
- approximation algorithms
- optimization problems
- graph edit distance
- optimal solution
- pattern recognition
- computer vision and machine learning
- edit distance
- matching algorithm
- learning algorithm
- special case
- pairwise
- computer vision