This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
October 2004 (vol. 26 no. 10)
pp. 1367-1372
We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of the algorithm has been presented in a previous paper, where we examined its performance for the isomorphism of small and medium size graphs. The algorithm is improved here to reduce its spatial complexity and to achieve a better performance on large graphs; its features are analyzed in detail with special reference to time and memory requirements. The results of a testing performed on a publicly available database of synthetically generated graphs and on graphs relative to a real application dealing with technical drawings are presented, confirming the effectiveness of the approach, especially when working with large graphs.

[1] J. Rocha and T. Pavlidis, "A Shape Analysis Model With Applications to a Character Recognition System," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 393-404, 1994.
[2] L.G. Shapiro and R.M. Haralick, Structural Description and Inexact Matching IEEE Trans. Pattern Analysis and Machine Intelligence, no. 3, pp. 505-519, 1981.
[3] L.P. Cordella and M. Vento, Symbol Recognition in Documents: A Collection of Techniques? Int'l J. Document Analysis and Recognition, vol. 3, pp. 73-88, 2000.
[4] J. Liu and Y.T. Lee, “A Graph-Based Method for Face Identification from a Single 2D Line Drawing,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1106-1119, 2001.
[5] J. Llados, E. Marti, and J.J. Villanueva, Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1137-1143, 2001.
[6] D. Conte, P. Foggia, C. Sansone, and M. Vento, Thirty Years of Graph Matching in Pattern Recognition Int'l J. Pattern Recognition and Artificial Intelligence, vol. 18, no. 3, pp. 265-298, 2004.
[7] L.P. Cordella, P. Foggia, C. Sansone, and M. Vento, Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs Computing, vol. 12, pp. 43-52, 1998.
[8] W.H. Tsai and K.S. Fu, Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition IEEE Trans. Systems, Man, and Cybernetics, vol. 13, pp. 48-62, 1983.
[9] L.G. Shapiro and R.M. Haralick, A Metric for Comparing Relational Descriptions IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 90-94, 1985.
[10] E.M. Luks, Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time J. Computer System Science, pp. 42-65, 1982.
[11] J.R. Ullmann, An Algorithm for Subgraph Isomorphism J. Assoc. for Computing Machinery, vol. 23, pp. 31-42, 1976.
[12] B.T. Messmer, Efficient Graph Matching Algorithms for Preprocessed Model Graphs PhD Thesis, Inst. of Computer Science and Applied Mathematics, Univ. of Bern, 1996.
[13] B.D. McKay, Practical Graph Isomorphism Congressus Numerantium, vol. 30, pp. 45-87, 1981.
[14] H. Bunke and B.T. Messmer, Efficient Attributed Graph Matching and Its Application to Image Analysis Proc. Image Analysis and Processing, pp. 45-55, 1995.
[15] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749–764, Aug. 1995.
[16] L.P. Cordella, P. Foggia, C. Sansone, and M. Vento, “Performance Evaluation of the VF Graph Matching Algorithm,” Proc. 10th Int'l Conf. Image Analysis Processing, 1999.
[17] P. Foggia, C. Sansone, and M. Vento, A Database of Graphs for Isomorphism and Sub Graph Isomorphism Benchmarking Proc. Third IAPR TC-15 Int'l Workshop Graph Based Representations, pp. 176-188, 2001.
[18] N.J. Nilsson, Principles of Artificial Intelligence. Springer-Verlag, 1982.
[19] B.T. Messmer and H. Bunke, A Decision Tree Approach to Graph and Subgraph Isomorphism Detection Pattern Recognition, vol. 32, pp. 1979-1998, 1999.
[20] M. Burge and W.G. Kropatsch, A Minimal Line Property Preserving Representation for Line Images Computing, vol. 62, no. 4, pp. 355-368, 1999.

Index Terms:
Graph-subgraph isomorphism, large graphs, attributed relational graphs.
Citation:
Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento, "A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 10, pp. 1367-1372, Oct. 2004, doi:10.1109/TPAMI.2004.75
Usage of this product signifies your acceptance of the Terms of Use.