18 citations · 44 across the 13 of their papers we have counts for
15 papers
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…
A Fast Parallel Approach for Neighborhood-based Link Prediction by Disregarding Large Hubs
Subhajit Sahu
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 bas…
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…
GVEL: Fast Graph Loading in Edgelist and Compressed Sparse Row (CSR) formats
Subhajit Sahu
Efficient IO techniques are crucial in high-performance graph processing frameworks like Gunrock and Hornet, as fast graph loading can help minimize processing time and reduce syst…