3 citations · 6 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DB2021★ 3 cited
HUGE: An Efficient and Scalable Subgraph Enumeration System
Zhengyi Yang, Longbin Lai, Xuemin Lin +2
Subgraph enumeration is a fundamental problem in graph analytics, which aims to find all instances of a given query graph on a large data graph. In this paper, we propose a system…
cs.DB2021★ 1 cited
FAST: FPGA-based Subgraph Matching on Massive Graphs
Xin Jin, Zhengyi Yang, Xuemin Lin +3
Subgraph matching is a basic operation widely used in many applications. However, due to its NP-hardness and the explosive growth of graph data, it is challenging to compute subgra…