A parallel and distributed program for super-fast K-Truss decomposition of extremely large and dense graphs
This course assignment was aimed at parallel and distributed programming of large graphs. We Implemented a scalable and efficient distributed program for k-truss decomposition using OpenMP for shared memory programming and MPI for distributed memory message passing to find advertisement groups and influencer vertices in extremely large graphs.
Chinmay Mittal
My research interests include Artificial Intelligence, particularly applications of Deep Learning in Natural Language Processing.