3 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.DB2018
DDSL: Efficient Subgraph Listing on Distributed and Dynamic Graphs
Xun Jian, Yue Wang, Xiayu Lei +2
Subgraph listing is a fundamental problem in graph theory and has wide applications in areas like sociology, chemistry, and social networks. Modern graphs can usually be large-scal…
cs.SI2018★ 3 cited
On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs
Xun Jian, Xiang Lian, Lei Chen
Modern networks are of huge sizes as well as high dynamics, which challenges the efficiency of community detection algorithms. In this paper, we study the problem of overlapping co…
cs.DB2017★ 3 cited
An Efficient Probabilistic Approach for Graph Similarity Search
Zijian Li, Xun Jian, Xiang Lian +1
Graph similarity search is a common and fundamental operation in graph databases. One of the most popular graph similarity measures is the Graph Edit Distance (GED) mainly because…