Sciweavers

Share
ICAPR
2005
Springer

The RW2 Algorithm for Exact Graph Matching

10 years 4 months ago
The RW2 Algorithm for Exact Graph Matching
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 used to match the nodes in two isomorphic graphs. However, the algorithm may suffer from the presence of colliding signatures in the same graph, which may prevent the procedure from finding the complete mapping between the matching nodes. In this paper we propose an improved version of the original algorithm, the RW2 algorithm, which progressively expands the node signatures by a recursive visit of the node descendants and ancestors to disambiguate the colliding signatures. The experimental results, performed on a benchmark dataset, show that the new algorithm attains a better matching rate with almost the same computational cost as the original one.
Marco Gori, Marco Maggini, Lorenzo Sarti
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ICAPR
Authors Marco Gori, Marco Maggini, Lorenzo Sarti
Comments (0)
books