3 citations · 6 across the 5 of their papers we have counts for
5 papers
On the Cross-type Homophily of Heterogeneous Graphs: Understanding and Unleashing
Zhen Tao, Ziyue Qiao, Chaoqi Chen +3
Homophily, the tendency of similar nodes to connect, is a fundamental phenomenon in network science and a critical factor in the performance of graph neural networks (GNNs). While…
HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs
Zhengyi Yang, Wenjie Zhang, Xuemin Lin +2
Hypergraphs are generalisation of graphs in which a hyperedge can connect any number of vertices. It can describe n-ary relationships and high-order information among entities comp…
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…
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…
A Survey and Experimental Analysis of Distributed Subgraph Matching
Longbin Lai, Zhu Qing, Zhengyi Yang +10
Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pr…