97 citations · 167 across the 24 of their papers we have counts for
9 papers · 1 filter
Efficient and Effective Community Search on Large-scale Bipartite Graphs
Kai Wang, Wenjie Zhang, Xuemin Lin +3
Bipartite graphs are widely used to model relationships between two types of entities. Community search retrieves densely connected subgraphs containing a query vertex, which has b…
A Framework to Quantify Approximate Simulation on Graph Data
Xiaoshuang Chen, Longbin Lai, Lu Qin +2
Simulation and its variants (e.g., bisimulation and degree-preserving simulation) are useful in a wide spectrum of applications. However, all simulation variants are coarse "yes-or…
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
Michael Yu, Lu Qin, Ying Zhang +2
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orient…
Scaling Up Distance-generalized Core Decomposition
Qiangqiang Dai, Rong-Hua Li, Lu Qin +4
Core decomposition is a fundamental operator in network analysis. In this paper, we study the problem of computing distance-generalized core decomposition on a network. A distance-…
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions
Hanchen Wang, Defu Lian, Ying Zhang +2
Entity interaction prediction is essential in many important applications such as chemistry, biology, material science, and medical science. The problem becomes quite challenging w…
Binarized Graph Neural Network
Hanchen Wang, Defu Lian, Ying Zhang +4
Recently, there have been some breakthroughs in graph analysis by applying the graph neural networks (GNNs) following a neighborhood aggregation scheme, which demonstrate outstandi…