Skip to main content

Table 3 Time complexity of ATria, compared to other centrality algorithms

From: ATria: a novel centrality algorithm applied to biological networks

Algorithm Time complexity
Betweenness O(n 3)
Closeness O(n 3)
Degree O(n 3)
PageTrust O(i·n 3)
PN O(i·n 3)
ATria O(n 4)
  1. For eigenvector-based algorithms, i is the number of iterations that it takes to converge