An Algorithm Portfolio for the Sub-graph Isomorphism Problem
This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a new association between two vertices is compatible by considering the structure of their local neighborhoods, represented as the number of limited-length paths of different type originating from each vertex. In addition, randomized versions of the algorithms are studied experimentally by deriving their run-time distributions. Finally, algorithm portfolios consisting of multiple instances of the same randomized algorithm are proposed and analyzed. The experimental results on benchmark graphs demonstrate that the new pruning method is competitive w.r.t. recently proposed techniques. Significantly better results are obtained on sparse graphs. Furthermore, even better results are obtained by the portfolios, when both the average and standard deviation of solution times are considered.
Unable to display preview. Download preview PDF.
- 2.Bunke, H., Messmer, B.T.: Recent advances in graph matching. IJPRAI 11(1), 169–203 (1997)Google Scholar
- 5.Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York, USA (1990)Google Scholar
- 6.McKay, B.: Practical graph isomorphism. In: Numerical mathematics and computing. In: Proc. 10th Manitoba Conf. Winnipeg/Manitoba, pp. 45–87 (1980)Google Scholar