Skip to main content

Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Fig. 2 | Applied Network Science

Fig. 2

From: Finding maximal bicliques in bipartite networks using node similarity

Fig. 2

Schematic illustration on toy example. In (i) we find basic bicliques, and then in (ii) we treat them as cliques. In (iii) we find inclusive neighborhoods for each node in cliques. In (iv) and (v) comparison between sets of nodes detects structural similarity between sets in order to merge them into larger bicliques. In (vi) the final two sets after merging are presented, and finally in (vii) the two overlapping strong communities are shown

Back to article page