On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem.
Anders DessmarkAndrzej LingasOscar GarridoPublished in: MFCS (1994)
Keyphrases
- matching algorithm
- matching process
- pattern matching
- worst case
- parallel implementation
- computational cost
- maximum number
- space complexity
- graph matching
- parallel processing
- template matching
- image matching
- feature points
- real time
- decision problems
- shape matching
- input data
- distributed memory
- minimum distance
- parallel programming
- sequence matching