Table 5.

The FLCD algorithm

Algorithm: The FLCD Algorithm
Input: $\mathcal{S}=V$ and k=20.
Output: A set of predicted complexes R.
1 While ($\exists v\in \mathcal{S}$ and d v≥3)
2 Estimate $\widehat{p}\approx p(\alpha ,v)$.
3 Sort nodes in V based on $\widehat{p}$ and collect the top k nodes in H v.
4 Finding the lowest-conductance set $H_v^{\ast }\in H_v$ based on (10).
5 Identifying the node set $C_v^{\ast }$ of the densest subnetwork in $H_v^{\ast }$ based on (12).
6 Considering $C_v^{\ast }$ as one predicted complex, let $R=\{R,C_v^{\ast }\}$ and$\mathcal{S}=\mathcal{S}-v$.
7 EndWhile
8 Remove duplicated complexes and complexes with size smaller than three in R.