FAST UNCOVERING OF GRAPH COMMUNITIES ON A CHIP

a) define the problem of community detection and highlight its scientific significance, b) relate to challenges in parallelizing the operation on modern day architectures, c) provide a detailed report and logical organization of the approaches that have been designed for various architectures, and d) provide insights into the strengths and suitability of different architectures for community detection, and a preview into the future trends of the area. While the focus is on community detection, the challenges, and techniques to overcome the challenges, transcend to several other graph problems that have applications in science and data analytics.