Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.

Benjamin Hellouin de Menibus Takeaki Uno

Published in: TAMC (2011)

Keyphrases

graph matching
matching algorithm
independent set
computational complexity
pairwise
keypoints
matching process
maximum weight
maximum cardinality
learning algorithm
special case
feature points
pattern matching
graph matching algorithm