Resolution Complexity of Perfect Matching Principles for Sparse Graphs.

Dmitry Itsykson Mikhail Slabodkin Dmitry Sokolov

Published in: CSR (2015)

Keyphrases

graph matching
graph theoretic
image matching
space complexity
subgraph isomorphism
sparse representation
matching process

matching algorithm
low resolution
polynomial time complexity
computational cost
high resolution
high dimensional
attributed relational graph

decision problems
bounded treewidth
maximum cardinality
gaussian graphical models
undirected graph
shape matching
directed graph

multiscale
pattern matching
np complete
feature points
d objects
computational complexity