Table 2.

Comparison of subgraph isomorphism algorithms.

	Search Stratergy	Reduce Search Space	Preprocessing Data	x Data Structure
FocusSearch [29]	Static Semi-target dependent	Local domain reduction	Yes	List
Lad [30]	Dynamic Target dependent	Domain reduction until convergence	Yes	Matrix
VFlib [3]	Dynamic Target dependent	Two-Look-Head pruning rules	No	List
RI	Static Target independent	Fast and light pruning rules	No	List

Review of some algorithmic aspects of the most recent subgraph isomorphism algorithms.