Finding the number of triangles in a network is an important problem in the analysis of complex networks (Graphs).
This is an MPI implementation of the algorithm presented in [1], for finding the exact number of triangles in massive networks, which is an improved version of PATRIC algorithm [2].
[1]: Shaikh Arifuzzaman, Maleq Khan, and Madhav Marathe. 2015. A Space-Efficient Parallel Algorithm for Counting Exact Triangles in Massive Networks. In Proceedings of the 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conf on Embedded Software and Systems (HPCC-CSS-ICESS '15). IEEE Computer Society, Washington, DC, USA, 527-534. DOI=http://dx.doi.org/10.1109/HPCC-CSS-ICESS.2015.301
[2]: Shaikh Arifuzzaman, Maleq Khan, and Madhav Marathe. 2013. PATRIC: a parallel algorithm for counting triangles in massive networks. In Proceedings of the 22nd ACM international conference on Information & Knowledge Management (CIKM '13). ACM, New York, NY, USA, 529-538. DOI=http://dx.doi.org/10.1145/2505515.2505545