1 paper
Shuai Ma, Yang Cao, Wenfei Fan +2
Graph pattern matching is often defined in terms of subgraph isomorphism, an NP-complete problem. To lower its complexity, various extensions of graph simulation have been consider…