Algorithms for projecting a bipartite network

Bipartite Graph or bipartite network (also known as two mode network) is often a general model of many real life complex networks and systems. However, due to the lack of analysis techniques, it is often converted into a unipartite network by one mode projection. Thus, performing faster one mode projection will lead to the faster analysis of input bipartite graph. In this paper, we have taken up the problem of one mode projection and presented three algorithms. All the algorithms have different working principles. The proposed algorithms have also been implemented on three benchmark datasets and execution times are reported.