190 citations · 769 across the 52 of their papers we have counts for
Showing 2017 · cs.DBShow all
3 papers · 2 filters
cs.DB2017★ 4 cited
An Optimal and Progressive Approach to Online Search of Top-k Influential Communities
Fei Bi, Lijun Chang, Xuemin Lin +1
Community search over large graphs is a fundamental problem in graph analysis. Recent studies propose to compute top-k influential communities, where each reported community not on…
cs.DB2017
Dynamical SimRank Search on Time-Varying Networks
Weiren Yu, Xuemin Lin, Wenjie Zhang +1
In this article, we study the efficient dynamical computation of all-pairs SimRanks on time-varying graphs. Li {\em et al}.'s approach requires time and m…
cs.DB2017
Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation
Lijun Chang, Xing Feng, Xuemin Lin +2
Graph edit distance (GED) is an important similarity measure adopted in a similarity-based analysis between two graphs, and computing GED is a primitive operator in graph database…