Skip to main content

Table 5 Comparison of computational complexity of CASCADE to competing clustering methods.

From: CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions

Method

Complexity

CASCADE

O(V 3log(V))

STM

O(V 2log(V))

Maximal clique

NP

Quasi clique

NP

Samanta

O(V 2log(V))

Minimum cut

O(V 2log(V) + V E)

Betweenness cut

O(V 2 + V E)

MCL

O(V 2log(V))

Chen

O(V 2 + V E)

Rives

O(V 2log(V))

SPC

O(V 2)