Performance evaluation of the VF graph matching algorithm

Proceedings - International Conference on Image Analysis and Processing, ICIAP 1999

Volumn , Issue , 1999, Pages 1172-1177

  Cordella, L P ^a   Foggia, P ^a   Sansone, C ^a   Vento, M ^a  

^a Dipartimento di Informatica e Sistemistica   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH MATCHINGS; GRAPH-MATCHING ALGORITHMS; LARGE GRAPHS; MEMORY REQUIREMENTS; OVERALL EFFICIENCY; PERFORMANCE ANALYSIS;

ALGORITHMS; IMAGE ANALYSIS; TOPOLOGY;

PATTERN MATCHING;

EID: 84890410415     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIAP.1999.797762     Document Type: Conference Paper

References (7)

1. L. G. Shapiro, R. M. Haralick, "Structural Description and Inexact Matching", IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 3, pp. 505-519, 1981.
2. J. R. Ullmann, "An Algorithm for Subgraph Isomorphism", Journal of the Association for Computing Machinery, vol. 23, pp. 31-42, 1976.
3. J. Hopcroft, J. Wong, "Linear time algorithm for isomorphism of planar graphs", in Proc. 6th Annual ACM Symp. Theory of Computing, pp. 172-184, 1974.
4. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The design and analysis of computer algorithms, Addison Wesley, 1974.
5. D. G. Corneil, C. C. Gotlieb, "An efficient algorithm for graph isomorphism", Journal of the Association for Computing Machinery, vol. 17, pp. 51-64, 1970.
6. H. Bunke, B. T. Messmer, "Efficient Attributed Graph Matching and its Application to Image Analysis", in C. Braccini, L. De Floriani, G. Vernazza (eds. ), Image Analysis and Processing, Berlin Heidelberg: Springer (Lecture Notes in Computer Science, vol. 974), pp. 45-55, 1995.
7. L. P. Cordella, P. Foggia, C. Sansone, M. Vento, "Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs", Computing, vol. 12, pp. 43-52, 1998.