56 search results - page 1 / 12 » The RW2 Algorithm for Exact Graph Matching |
ICAPR
2005
Springer
13 years 10 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
CORR
2008
Springer
13 years 2 months ago
2008
Springer
SIBGRAPI
2005
IEEE
13 years 10 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...