Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem.

Elias Dahlhaus Marek Karpinski

Published in: J. Comput. Syst. Sci. (1992)

Keyphrases

graph matching
special case
image matching
feature points
matching algorithm
matching process
feature matching
pattern matching
maximum cardinality
database
graph model
computationally hard
approximate matching