A fast algorithm for subgraph search problem
Karam Gouda, Mosab Hassaan · 2012
Graphs are widely used to model complicated data se-mantics in many applications. In this paper we pro-pose Fast-ON, an efficient algorithm for subgraph iso-morphism problem which has proven to be NP-complete. Fast-ON is based on Ullman algorithm [8]. It improves the search space of Ullman algorithm by considering two effective optimizations. Comparing to the well-known algo-rithms Ullman and Vflib [3], Fast-ON achieves up to 1-3 orders of magnitude speed-up. 1.