20 citations · 51 across the 11 of their papers we have counts for
3 papers · 1 filter
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…
Sequenced Route Query with Semantic Hierarchy
Yuya Sasaki, Yoshiharu Ishikawa, Yasuhiro Fujiwara +1
The trip planning query searches for preferred routes starting from a given point through multiple Point-of-Interests (PoI) that match user requirements. Although previous studies…
Fast and Exact Top-k Search for Random Walk with Restart
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuka +1
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity scor…