Subgraph isomorphism detection in polynomial time on preprocessed model graphs
In this paper, a new method for graph and subgraph isomorphism detection based on a decision tree representation is proposed. The decision tree is generated off-line from a priori known model graphs. At run time the decision tree is used to detect all graph and subgraph isomorphisms from an input graph to any of the model graphs in time that is only polynomial in the size of the graphs and independent of the number of model graphs. However, the decision tree is of exponential size. In order to reduce the size of the decision tree, we propose two pruning techniques. Experimental results confirming the efficiency of the method will be given.
Unable to display preview. Download preview PDF.
- 1.H. Bunke. Structural and syntactic pattern recognition. In C.H. Chen, L.F. Pau, and P. Wang, editors, Handbook of Pattern Recognition and Computer Vision, pages 163–209. World Scientific Publ. Co. Singapore, 1993.Google Scholar
- 2.J.R. Ullman. An algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery, 23(1):31–42, 1976.Google Scholar
- 3.W.J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI, 17(8):749–764, 1995.Google Scholar
- 4.R. Horaud and T. Skordas. Stereo correspondence through feature grouping and maximal cliques. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI, 11(11):1168–1180, 1989.Google Scholar
- 5.C.M. Hoffman. Group-theoretic Algorithms and Graph Isomorphism. Springer Verlag, 1982.Google Scholar
- 6.E.M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences, pages 42–65, 1982.Google Scholar
- 7.B.T. Messmer and H. Bunke. Subgraph isomorphism in polynomial time. Technical Report IAM-95-003, University of Bern, 1995.Google Scholar