43 citations · 43 across the 2 of their papers we have counts for
2 papers
cs.DB2023★ 43 cited
GuP: Fast Subgraph Matching by Guard-based Pruning
Junya Arai, Yasuhiro Fujiwara, Makoto Onizuka
Subgraph matching, which finds subgraphs isomorphic to a query, is the key to information retrieval from data represented as a graph. To avoid redundant exploration in the data, ex…
cs.DB2020
Fast Subgraph Matching by Exploiting Search Failures
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…