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 $O(r^4{n}^2)$ time and $O(r^2{n}^2)$ m…