On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.

B. S. Panda Arti Pandey

Published in: ICTCSDM (2016)

Keyphrases

graph matching
independent set
matching algorithm
pattern matching
feature points
spanning tree
association graph
computational cost
keypoints
graph matching algorithm
space complexity
bounded treewidth
attributed relational graph
string matching
graph theoretic
graph model
matching process
worst case