433 citations · 968 across the 48 of their papers we have counts for
4 papers · 2 filters
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…
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…
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…
Enumerating k-Vertex Connected Components in Large Graphs
Dong Wen, Lu Qin, Xuemin Lin +2
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network…