Affiliation:
1. Faculty of Computer and Information Science , University of Ljubljana , Večna pot 113 , Ljubljana , , Slovenia
Abstract
Abstract
In this paper, we study a well-known computationally hard problem, called the subgraph isomorphism problem where the goal is for a given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. Numerous algorithms for solving the problem exist in the literature and most of them are based on the backtracking approach. Since straightforward backtracking is usually slow, many algorithmic refinement techniques are used in practical algorithms. The main goal of this paper is to study such refinement techniques and to determine their ability to speed up backtracking algorithms. To do this we use a methodology of experimental algorithmics. We perform an experimental evaluation of the techniques and their combinations and, hence, demonstrate their usefulness in practice.
Reference28 articles.
1. Dimitris K Agrafiotis, Victor S Lobanov, Maxim Shemanarev, Dmitrii N Rassokhin, Sergei Izrailev, Edward P Jaeger, Simson Alex, and Michael Farnum. Efficient Substructure Searching of Large Chemical Libraries: The ABCD Chemical Cartridge. J. Chem. Inf. Model., 2011.
2. John M Barnard. Substructure searching methods: Old and new. J. Chemical Information and Computer Sciences, 33(4):532–538, 1993.
3. Wenfei Fan. Graph pattern matching revised for social network analysis. In Proc. 15th International Conference on Database Theory - ICDT ’12, page 8. ACM Press, March 2012.
4. Jianzhuang Liu and Yong Tsui Lee. Graph-based method for face identification from a single 2D line drawing. IEEE Trans. Pattern Analysis and Machine Intelligence, 23(10):1106–1119, 2001.
5. Catherine C. McGeoch. A guide to experimental algorithmics. Cambridge University Press, New York, NY, USA, 1st edition, 2012.