Taming verification hardness: an efficient algorithm for testing subgraph isomorphism