Login / Signup
The polynomially bounded perfect matching problem is in NC^2.
Manindra Agrawal
Thanh Minh Hoang
Thomas Thierauf
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
polynomially bounded
matching algorithm
pattern matching
graph matching
matching process
matching scheme
feature matching
multiresolution
keypoints
image matching
approximate matching
image set
shape matching
data sets
bayesian networks
three dimensional
image processing
computer vision