CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2004 vol.26 Issue No.10 - October
Issue No.10 - October (2004 vol.26)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2004.75
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.
Graph-subgraph isomorphism, large graphs, attributed relational graphs.
Luigi P. Cordella, Carlo Sansone, Mario Vento, "A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.26, no. 10, pp. 1367-1372, October 2004, doi:10.1109/TPAMI.2004.75