The Community for Technology Leaders
Green Image
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.

P. Foggia, L. P. Cordella, C. Sansone and M. Vento, "A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 26, no. , pp. 1367-1372, 2004.
80 ms
(Ver 3.3 (11022016))