18 citations · 44 across the 13 of their papers we have counts for
8 papers · 1 filter
Lock-Free Computation of PageRank in Dynamic Graphs
Subhajit Sahu
PageRank is a metric that assigns importance to the vertices of a graph based on its neighbors and their scores. Recently, there has been increasing interest in computing PageRank…
DF* PageRank: Improved Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs
Subhajit Sahu
PageRank is a widely used centrality measure that assesses the significance of vertices in a graph by considering their connections and the importance of those connections. Efficie…
GVE-Leiden: Fast Leiden Algorithm for Community Detection in Shared Memory Setting
Subhajit Sahu
Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions is critical in a number of application…
GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in Shared Memory Setting
Subhajit Sahu
Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for this purpose are crucial in various applications, particularly as…
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model
Kishore Kothapalli, Shreyas Pai, Sriram V. Pemmaraju
Motivated by recent progress on symmetry breaking problems such as maximal independent set (MIS) and maximal matching in the low-memory Massively Parallel Computation (MPC) model (…
CPU and/or GPU: Revisiting the GPU Vs. CPU Myth
Kishore Kothapalli, Dip Sankar Banerjee, P. J. Narayanan +13
Parallel computing using accelerators has gained widespread research attention in the past few years. In particular, using GPUs for general purpose computing has brought forth seve…