While doing research work with Prof. Kishore Kothapalli, and Prof. Dip Sankar Banerjee.
Abstract — Dynamic graph algorithms is a promising field that offers a wide range of opportu- nities to address some of the most challenging problems in graph analysis. There are many open questions to be explored regarding the detection of communities, influence maximization, sub- graph detection, and truss computation in dynamic graphs, as well as the potential for utilizing different processing models to improve performance and scalability. As the volume and complex- ity of graph data continue to grow, it is essential that we continue to develop more efficient and effective methods for analyzing dynamic graphs. The development of new and improved algo- rithms and processing models in this area will be critical for uncovering important insights and enabling new discoveries in fields such as social networks, biology, transportation and many other application domains. Thus the research in dynamic graph algorithms is the need of the hour and is expected to see an increase in attention and resources in the near future.
Index terms — Temporal graph, Link analysis, Dynamic PageRank, Community detection, Dynamic Louvain.