Issue No. 02 - March/April (2000 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.842269
<p><b>Abstract</b>—Graphs are a powerful and universal data structure useful in various subfields of science and engineering. In this paper, we propose a new algorithm for subgraph isomorphism detection from a set of a priori known model graphs to an input graph that is given online. The new approach is based on a compact representation of the model graphs that is computed offline. Subgraphs that appear multiple times within the same or within different model graphs are represented only once, thus reducing the computational effort to detect them in an input graph. In the extreme case where all model graphs are highly similar, the run-time of the new algorithm becomes independent of the number of model graphs. Both a theoretical complexity analysis and practical experiments characterizing the performance of the new approach will be given.</p>
Graph matching, graph isomorphism, subgraph isomorphism, preprocessing.
Bruno T. Messmer, Horst Bunke, "Efficient Subgraph Isomorphism Detection: A Decomposition Approach", IEEE Transactions on Knowledge & Data Engineering, vol. 12, no. , pp. 307-323, March/April 2000, doi:10.1109/69.842269