Efficient Subgraph Matching by Postponing Cartesian Products
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism