A large database of graphs and its use for benchmarking graph isomorphism algorithms

Pattern Recognition Letters

Volumn 24, Issue 8, 2003, Pages 1067-1079

  De Santo, M ^a   Foggia, P ^b   Sansone, C ^b   Vento, M ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Benchmarking; Exact graph matching; Graph database; Graph isomorphism

Indexed keywords

ALGORITHMS; BENCHMARKING; DATABASE SYSTEMS;

GRAPH MATCHING;

GRAPH THEORY;

GRAPHICAL METHOD;

EID: 0347298542     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00253-2     Document Type: Article

References (20)

1. Abdulrahim, M., Misra, M., 1998. A graph isomorphism algorithm for object recognition. Pattern Anal. Appl. 1 (3), 189-201.
2. Bunke, H., Messmer, B.T., 1995. Efficient attributed graph matching and its application to image analysis. In: Braccini, C., De Floriani, L., Vernazza, G. (Eds.), Image Analysis and Processing. Springer, Berlin, pp. 45-55.
3. Bunke, H., Vento, M. 1999. Benchmarking of graph matching algorithms. In: Proceedings of the 2nd Workshop on Graph-based Representations. Haindorf, pp. 109-114.
4. Christmas, W.J., Kittler, J., Petrou, M., 1995. Structural matching in computer vision using probabilistic relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 17 (8), 749-764.
5. Cordella, L.P., Foggia, P., Sansone, C., Vento, M., 1998. Subgraph Transformations for the inexact matching of attributed relational graphs. Comput. Suppl. 12, 43-52.
6. Cordella, L.P., Foggia, P., Sansone, C., Vento, M., 1999. Performance evaluation of the VF graph matching algorithm. In: Proceedings of the 10th ICIAP, IEEE Computer Society Press, pp. 1172-1177.
7. Cordella, L.P., Foggia, P., Sansone, C., Vento, M., 2001. An improved algorithm for matching large graphs. In: Proceedings of the 3rd IAPR-TC-15 International Workshop on Graph-based Representations. Italy, pp. 149-159.
8. De Jong, K.A., Spears, W.M., 1989. Using genetic algorithms to solve NP-complete problems. In: Schaffer, J.D. (Ed.), Genetic Algorithms. Morgan Kaufmann, Los Altos, CA, pp. 124-132.
9. Hopcroft, J., Wong, J., 1974. Linear time algorithm for isomorphism of planar graphs. In: Proceedings of the 6th Annual ACM Symposium on Theory of Computing, pp. 172-184.
10. Jiang, X., Bunke, H., 1996. Including geometryin graph representations: a quadratic time isomorphism algorithm and its applications. In: Perner, P., Wang, P., Rosenfeld, A. (Eds.), Lecture Notes in Computer Science, 1121, pp. 110- 119.
11. Luks, E.M., 1982. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci., 42- 65.
12. McKay, B.D., 1981. Practical graph isomorphism. Congressus Numerantium 30, 45-87.
13. Messmer, B.T., 1996. Efficient Graph Matching Algorithms for Preprocessed Model Graphs, Ph.D. Thesis, Institute of Computer Science and Applied Mathematics, University of Bern.
14. Messmer, B.T., Bunke, H., 1999. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recogn. 32, 1979-1998.
15. Miyazaki, T., 1997. The complexity of McKay's canonical labeling algorithm. In: Finkelstein, L., Kantor, W.M. (Eds.), Groups and Computation, II. American Mathematical Society, Providence, RI, pp. 239-256.
16. Rouvray, D.H., Balaban, A.T., 1979. Chemical applications of graph theory. In: Applications of Graph Theory. Academic Press, New York, pp. 177-221.
17. Schmidt, D.C., Druffel, L.E., 1976. A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices. J. ACM 23, 433-445.
18. Shearer, K., Bunke, H., Venkatesh, S., Kieronska, D., 1998. Graph matching for video indexing. Comput. Suppl. 12, 53- 62.
19. Ullmann, J.R., 1976. An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 23, 31-42.
20. Wong, E.K., 1992. Model matching in robot vision by subgraph isomorphism. Pattern Recogn. 25 (3), 287-304.