Efficient parallel algorithms for betweenness-and closeness-centrality in dynamic graphs K Shukla, SC Regunta, SH Tondomker, K Kothapalli Proceedings of the 34th ACM International Conference on Supercomputing, 1-12, 2020 | 16 | 2020 |
Efficient parallel algorithms for dynamic closeness‐and betweenness centrality SC Regunta, SH Tondomker, K Shukla, K Kothapalli Concurrency and Computation: Practice and Experience, e6650, 2021 | 5 | 2021 |
BRICS–Efficient Techniques for Estimating the Farness-Centrality in Parallel SC Regunta, SH Tondomker, K Kothapalli 2019 IEEE International Parallel and Distributed Processing Symposium …, 2019 | 5 | 2019 |
An Efficient Ear Decomposition Algorithm D Dutta, K Kothapalli, G Ramakrishna, SC Regunta, TS Harsh 15th CTW on Graphs and Combinatorial Optimization, 65-68, 2017 | 1 | 2017 |
Efficient Multicore Algorithms for Farness-and Closeness-Centrality in Static and Dynamic Graphs SC Regunta International Institute of Information Technology Hyderabad, 2020 | | 2020 |