Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density.
Marek KarpinskiAndrzej RucinskiEdyta SzymanskaPublished in: Int. J. Found. Comput. Sci. (2010)
Keyphrases
- computational complexity
- pattern matching
- matching algorithm
- neural network
- special case
- matching process
- np complete
- graph matching
- decision problems
- rate distortion
- high computational complexity
- matching scheme
- graph theory
- shape matching
- template matching
- feature points
- motion estimation
- information retrieval
- computationally efficient
- np hard
- density function
- feature matching
- pairwise