On the computational complexity of the bipartizing matching problem.
Carlos V. G. C. LimaDieter RautenbachUéverton S. SouzaJayme Luiz SzwarcfiterPublished in: Ann. Oper. Res. (2022)
Keyphrases
- computational complexity
- pattern matching
- graph matching
- np hard
- decision problems
- computationally efficient
- high computational complexity
- data structure
- matching algorithm
- keypoints
- matching scheme
- matching process
- image matching
- np complete
- machine learning
- real world
- feature points
- template matching
- low complexity
- memory requirements
- special case
- multiscale
- affine invariant
- string matching
- artificial intelligence