2 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.IR2021★ 2 cited
An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching
Zite Jiang, Boxiao Liu, Shuai Zhang +3
Subgraph matching is a NP-complete problem that extracts isomorphic embeddings of a query graph in a data graph . In this paper, we present a framework with three components…
cs.DS2020★ 2 cited
Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
Zite Jiang, Tao Liu, Shuai Zhang +3
In the big data era, graph computing is widely used to exploit the hidden value in real-world graphs in various scenarios such as social networks, knowledge graphs, web searching,…
cs.DC2020★ 1 cited
An Efficient and Balanced Graph Partition Algorithm for the Subgraph-Centric Programming Model on Large-scale Power-law Graphs
Shuai Zhang, Zite Jiang, Xingzhong Hou +3
The subgraph-centric programming model is a promising approach and has been applied in many state-of-the-art distributed graph computing frameworks. However, traditional graph part…