4 citations · 5 across the 3 of their papers we have counts for
5 papers
K-Core Maximization through Edge Additions
Zhongxin Zhou, Fan Zhang, Xuemin Lin +2
A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of v…
A Survey and Experimental Analysis of Distributed Subgraph Matching
Longbin Lai, Zhu Qing, Zhengyi Yang +10
Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pr…
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…