Issue No. 05 - May (1998 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.682179
<p><b>Abstract</b>—In this paper, we propose a new algorithm for error-correcting subgraph isomorphism detection from a set of model graphs to an unknown input graph. The algorithm is based on a compact representation of the model graphs. This representation is derived from the set of model graphs in an off-line preprocessing step. The main advantage of the proposed representation is that common subgraphs of different model graphs are represented only once. Therefore, at run time, given an unknown input graph, the computational effort of matching the common subgraphs for each model graph onto the input graph is done only once. Consequently, the new algorithm is only sublinearly dependent on the number of model graphs. Furthermore, the new algorithm can be combined with a future cost estimation method that greatly improves its run-time performance.</p>
Graphs, subgraph isomorphism, graph matching, error-correcting graph matching, search, graph algorithms, graph decomposition.
Bruno T. Messmer, Horst Bunke, "A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 20, no. , pp. 493-504, May 1998, doi:10.1109/34.682179