Fig. 3

One step of the CLPb algorithm in a bipartite network. In a, the process is performed from the top layer, considering the propagators vertex \(\in {\mathcal {V}}_1\), to the bottom layer, considering the receiver nodes \(\in {\mathcal {V}}_2\). At first, represented in (b), equal labels are merged. In c, second step, remaining labels are normalized. In third step, the label B is selected, as showed in (d). In e, the restriction 4 and 5 are tested. Finally, label B is propagated to the node in the bottom layer, as illustrated by the black dashed line