Fig. 2From: Finding maximal bicliques in bipartite networks using node similaritySchematic 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 shownBack to article page