. Author manuscript; available in PMC: 2018 Mar 1.

Published in final edited form as: IEEE Trans Knowl Data Eng. 2016 Nov 29;29(3):613–626. doi: 10.1109/TKDE.2016.2633464

TABLE 2.

Comparison of proposed algorithms.

Algorithm

Time Complexity

Remark

TEAMREP-BASIC

O(nlr′t³)

Direct graph computations

TEAMREP-FAST-EXACT

O ((\sum_{i \in T / p} d_{i}) (l t^{5} + l^{3} t^{3}))

Pruning + smoothness

TEAMREP-FAST-APPROX

O ((\sum_{i \in T / p} d_{i}) (l t^{2} r + r^{6}))

Pruning + smoothness + low-rank approximation

TEAMREP-FAST-APPROXCORR

O ((\sum_{i \in T / p} d_{i}) (l t r^{2} + r^{6}))

Pruning + smoothness + low-rank approximation + node correspondence