Kishore Kothapalli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kishore Kothapalli has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Subhajit Sahu
Computer Science Engineering, SRM University AP, Amaravati, Andhra Pradesh, India
7 shared publications - Dip Sankar Banerjee
Indian Institute of Technology Jodhpur, Jodhpur, Rajasthan, INDIA
5 shared publications - Dharma Teja Vooturi
Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad India
2 shared publications Kshitij Shukla
Center for Security, Theory, and Algorithmic Research International Institute of Information Technology Hyderabad India
2 shared publications- Lokesh Venkatachalam
International Institute of Information Technology Hyderabad, Hyderabad, India
2 shared publications Sai Charan Regunta
Center for Security, Theory, and Algorithmic Research International Institute of Information Technology Hyderabad India
2 shared publications
Latest Publications
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 309-319
Efficient Parallel Algorithms for Dynamic Percolation Centrality
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 309-319
Open AccessEfficient Parallel Algorithms for Dynamic Percolation Centrality
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 95-103
PHEM: A Computational Model for Designing Parallel Algorithms for Very Large Graphs
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 95-103
Open AccessPHEM: A Computational Model for Designing Parallel Algorithms for Very Large Graphs
- 11 June 2025
- Published by Springer Nature
- p. 268-280
GVEL: Fast Graph Loading in Edgelist and Compressed Sparse Row (CSR) Formats
- 11 June 2025
- Published by Springer Nature
- p. 268-280
GVEL: Fast Graph Loading in Edgelist and Compressed Sparse Row (CSR) Formats
- 10 June 2025
- Published by Springer Nature
- p. 361-366
High-Speed Neighborhood-Based Link Prediction by Disregarding Large Hubs
- 10 June 2025
- Published by Springer Nature
- p. 361-366
High-Speed Neighborhood-Based Link Prediction by Disregarding Large Hubs
- 10 June 2025
- Published by Springer Nature
- p. 93-104
GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in the Shared Memory Setting
- 10 June 2025
- Published by Springer Nature
- p. 93-104
GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in the Shared Memory Setting
- 28 March 2025
- Published by Springer Nature
- p. 127-139
High-Performance Implementation of Louvain Algorithm with Representational Optimizations
- 28 March 2025
- Published by Springer Nature
- p. 127-139
High-Performance Implementation of Louvain Algorithm with Representational Optimizations
- Open Access
- 4 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 152-160
Fast Deterministic Massively Parallel Ruling Sets Algorithms
- 4 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 152-160
Open AccessFast Deterministic Massively Parallel Ruling Sets Algorithms
- 27 November 2024
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (2)
A Fast Parallel Approach for Neighborhood‐Based Link Prediction by Disregarding Large Hubs
Link prediction can help rectify inaccuracies in various graph algorithms, stemming from unaccounted‐for or overlooked links within networks. However, many existing works use a baseline approach, which incurs unnecessary computational costs due to its high time complexity. Further, many studies focus on smaller graphs, which can lead to misleading conclusions. Here, we study the prediction of links using neighborhood‐based similarity measures on large graphs. In particular, we improve upon the baseline approach (IBase), and propose a heuristic approach that additionally disregards large hubs (DLH), based on the idea that high‐degree nodes contribute little similarity among their neighbors. On a server equipped with dual 16‐core Intel Xeon Gold 6226R processors, DLH is on average faster than IBase, especially on web graphs and social networks, while maintaining similar prediction accuracy. Notably, DLH achieves a link prediction rate of 38.1M edges/s and improves performance by for every doubling of threads.
- 27 November 2024
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (2)
A Fast Parallel Approach for Neighborhood‐Based Link Prediction by Disregarding Large Hubs
Link prediction can help rectify inaccuracies in various graph algorithms, stemming from unaccounted‐for or overlooked links within networks. However, many existing works use a baseline approach, which incurs unnecessary computational costs due to its high time complexity. Further, many studies focus on smaller graphs, which can lead to misleading conclusions. Here, we study the prediction of links using neighborhood‐based similarity measures on large graphs. In particular, we improve upon the baseline approach (IBase), and propose a heuristic approach that additionally disregards large hubs (DLH), based on the idea that high‐degree nodes contribute little similarity among their neighbors. On a server equipped with dual 16‐core Intel Xeon Gold 6226R processors, DLH is on average faster than IBase, especially on web graphs and social networks, while maintaining similar prediction accuracy. Notably, DLH achieves a link prediction rate of 38.1M edges/s and improves performance by for every doubling of threads.
- 26 August 2024
- Published by Springer Nature
- p. 312-326
DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs
- 26 August 2024
- Published by Springer Nature
- p. 312-326
DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs
- Open Access
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 11-20
Fast Leiden Algorithm for Community Detection in Shared Memory Setting
Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions is critical in a number of applications, where the size of datasets have reached significant scales. This paper presents one of the most efficient implementations of the Leiden algorithm, a high quality community detection method. On a server equipped with dual 16-core Intel Xeon Gold 6226R processors, our Leiden implementation, which we term as GVE-Leiden, outperforms NetworKit Leiden and cuGraph Leiden (running on NVIDIA A100 GPU) by 8.2 × and 3.0 × respectively — achieving a processing rate of 403M edges/s on a 3.8B edge graph. In addition, GVE-Leiden improves performance at a rate of 1.6 × for every doubling of threads.
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 11-20
Open AccessFast Leiden Algorithm for Community Detection in Shared Memory Setting
Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions is critical in a number of applications, where the size of datasets have reached significant scales. This paper presents one of the most efficient implementations of the Leiden algorithm, a high quality community detection method. On a server equipped with dual 16-core Intel Xeon Gold 6226R processors, our Leiden implementation, which we term as GVE-Leiden, outperforms NetworKit Leiden and cuGraph Leiden (running on NVIDIA A100 GPU) by 8.2 × and 3.0 × respectively — achieving a processing rate of 403M edges/s on a 3.8B edge graph. In addition, GVE-Leiden improves performance at a rate of 1.6 × for every doubling of threads.