1 paper
Junya Arai, Makoto Onizuka, Yasuhiro Fujiwara +1
Subgraph matching is a compute-intensive problem that asks to enumerate all the isomorphic embeddings of a query graph within a data graph. This problem is generally solved with ba…