The world is in the midst of an unprecedented growth of interconnected data, and graph processing systems are expected to play a vital role. Conventional graph algorithms designed for static graphs struggle to efficiently handle the continuous changes and updates that occur within these networks. As these networks grow in complexity, there is a need for algorithms capable of efficiently analyzing dynamic graph data. Our research aims to address the challenges posed by the need for real-time insights and scalable processing in dynamic and complex networks.
However, many dynamic algorithms are sequential, tailored towards web graphs, do not utilize reducibility, locality benefits of SCCs, overestimate affected vertices, have high overhead, do not have well optimized implementations, do not take advantage of auxiliary information, and do not gracefully tolerate soft-faults which modern architectures introduce. Our dynamic approaches for PageRank and community detection address these issues. Our work has been accepted by the Euro-Par conference (1), the ICPP conference (1), the Complex Networks conference (1), the IPDPS workshops (4), and the Euro-Par workshops (2).
▌ 😺 GitHub 🎓 Google Scholar 🆔 ORCiD 🌳 Scopus ⛛ Web of Science
▌ 🎃 Top Conferences 📚 Top Journals 👨🏫 Top Researchers 📰 Research Notes
- 📰 ν-LPA: Fast GPU-based Label Propagation Algorithm (LPA) for Community Detection; Subhajit Sahu, Mahen N, Kishore Kothapalli (IPDPSW PDSEC 2025, IEEE)
- 📰 High-Performance Implementation of Louvain Algorithm with Representational Optimizations; Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee (Complex Networks 2024, Springer SCI)
- 📰 GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in Shared Memory Setting; Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee (Euro-Par HiPES 2024, Springer LNCS)
- 📰 GVEL: Fast Graph Loading in Edgelist and Compressed Sparse Row (CSR) formats; Subhajit Sahu, Kishore Kothapalli (Euro-Par AMTE 2024, Springer LNCS)
- 📰 High-Speed Neighborhood-based Link Prediction by Disregarding Large Hubs; Subhajit Sahu, Kishore Kothapalli (Euro-Par 2024 PhD Symposium, Springer LNCS)
- 📰 DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs; Subhajit Sahu, Kishore Kothapalli, Hemalatha Eedi, Sathya Peri (Euro-Par 2024, Springer LNCS)
- 📰 Fast Leiden Algorithm for Community Detection in Shared Memory Setting; Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee (ICPP 2024, ACM)
- 📰 Lock-free Computation of PageRank in Dynamic Graphs; Subhajit Sahu, Kishore Kothapalli, Hemalatha Eedi, Sathya Peri (IPDPSW ParSocial 2024, IEEE)
- 📰 Shared-Memory Parallel Algorithms for Community Detection in Dynamic Graphs; Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee (Outstanding paper, IPDPSW ADPCM 2024, IEEE)
- 📰 Dynamic Batch Parallel Algorithms for Updating PageRank; Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee (IPDPSW ParSocial 2022, IEEE)
- 📰 GVE-LPA and GSL-LPA: High-speed and internally-connected label propagation on multicore systems; Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee (Future Generation Computer Systems 2025)
- 📰 Parallel Multicore Algorithms for Community Detection in Dynamic Graphs; Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee (International Journal of Networking and Computing 2025)
- 📰 A Fast Parallel Approach for Neighborhood-based Link Prediction by Disregarding Large Hubs; Subhajit Sahu, Kishore Kothapalli (Concurrency and Computation: Practice and Experience 2024, Wiley)
- 📰 EvolvGraph: A Tool for Property-Constrained Generation of Dynamic Graphs; Karan Nijhawan, Rajendraprasad Saravanan, Subhajit Sahu, Kishore Kothapalli (HiPC 2024 SRS, IEEE)
- 📰 Shared-Memory Parallel Dynamic Louvain Algorithm for Community Detection; Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee (IPDPS Poster 2024, IEEE)
- 📰 Performance Comparison of Graph Representations ... Dynamic Graph Updates (2025)
- 📰 CPU vs. GPU for Community Detection: ... Insights from GVE-Louvain and ν-Louvain (2025)
- 📰 Memory Efficient GPU-based LPA for Community Detection on Large Graphs (2024)
- 📰 Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches (2024)
- 📰 Heuristic-based Dynamic Leiden ... Efficient Tracking of Communities ... (2024)
- 📰 A Starting Point for Dynamic Community Detection with Leiden Algorithm (2024)
- 📰 Efficient GPU Implementation of ... DF-P PageRank for Dynamic Graphs (2024)
- 📰 DF Louvain: Fast Incrementally Expanding Approach for ... on Dynamic Graphs (2024)
- 📰 GSL-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection with no ... (2024)
- 📰 An Approach for ... Internally-Disconnected Communities in Louvain ... (2024)
- 📰 A Fast Parallel ... Neighborhood-based Link Prediction by Disregarding Large Hubs (2024)
- 📰 DF* PageRank: ... Incrementally Expanding Approaches for Updating PageRank on ... (2024)
- 📰 An Incrementally Expanding Approach for Updating PageRank on Dynamic Graphs (2024)
- 📰 GVE-Leiden: Fast Leiden Algorithm for Community Detection in Shared ... (2023)
- 📰 GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection ... (2023)
- 📰 GVE-Louvain: Fast Louvain Algorithm for Community Detection in Shared ... (2023)
- 📰 GVEL: Fast Graph Loading in Edgelist and Compressed Sparse Row (CSR) formats (2023)
- 📰 Heuristics for Inequality minimization in PageRank values (2023)
- 📰 Enhancing Efficiency in Parallel Louvain Algorithm for Community Detection (2023)
- 📰 Effect of stepwise adjustment of Damping factor upon PageRank (2021)
- 📓 Time Efficient, Space Efficient, and Fault Tolerant Social Network Algorithms for Static and Dynamic Graphs (2025)
- 📓 Design and Implementation of a Heterogeneous Sensor-based Embedded System for Flood Management (2014)
- 💰 IEEE IPDPS 2025 Student Travel Grant (TCPP).
- 💰 Scholarship for Events on Complex Systems (SECS) for attending Complex Networks 2024.
