An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
Journal of the ACM (JACM)
Performance Evaluation of the VF Graph Matching Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Graph matching using Random Walks
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM Transactions on Internet Technology (TOIT)
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Generic Set Theory-Based Pattern Matching Approach for the Analysis of Conceptual Models
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Hi-index | 0.00 |
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.