The RW2 algorithm for exact graph matching

Lecture Notes in Computer Science

Volumn 3686, Issue PART I, 2005, Pages 81-88

  Gori, Marco ^a   Maggini, Marco ^a   Sarti, Lorenzo ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL METHODS; COSTS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; GRAPH THEORY; RANDOM PROCESSES; TOPOLOGY;

GRAPH MATCHING; ISOMORPHIC GRAPHS; RANDOM WALK THEORY; RW2 ALGORITHM;

PATTERN RECOGNITION;

EID: 27244433328     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11551188_9     Document Type: Conference Paper

References (14)

1. Conte, D., Foggia, P., Sansone, P., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18 (2004) 265-298
2. Ullmann, J.: An algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery 23 (1976) 31-42
3. Schmidt, D., Druffel, L.: A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices. Journal of the Association for Computing Machinery 23 (1976) 433-445
4. Cordella, L., Foggia, P., Sansone, C., Vento, M.: Evaluation performance of the VF graph matching algorithm. In: Proceedings of the 10th International Conference on Image Analysis and Processing, IEEE Computer Society Press (1999) 1172-1177
5. McKay, B.: Practical graph isomorphism. Congressus Numerantium 30 (1981) 45-87
6. Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: Proceedings of the 3rd IAPR TC-15 International Workshop on Graph-based Representation. (2001)
7. Gori, M., Maggini, M., Sarti, L.: Graph matching using random walks. In: Proceedings of the International Conference on Pattern Recongition. Volume 3., Cambridge, UK (2004) 394-397
8. Umeyama, S.: An eigen-decomposition approach to weighted graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence 10-5 (1988) 695-703
9. Robles-Kelly, A., Hancock, E.: String edit distance, random walks and graph matching. International Journal of Pattern Recognition and Artificial Intelligence 18 (2004) 315-327
10. Robles-Kelly, A., Hancock, E.: Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence 27 (2005) 365-378
11. Gori, M., M. Maggini, M., Sarti, L.: Exact and approximate graph matching using random walks. IEEE Transactions on Pattern Analysis and Machine Intelligence (2005) - To appear.
12. Seneta, E.: Non-negative matrices and Markov chains. Springer-Verlag (1981)
13. Bianchini, M., Gori, M., Scarselli, F.: Inside pagerank. ACM Transactions on Internet Technology 5 (2005)
14. Foggia, P., Sansone, C., Vento, M.: A performance comparison of five algorithms for graph isomorphism. In: Proceedings of the 3rd IAPR TC-15 International Workshop on Graph-based Representation, IEEE Computer Society Press (2001)