18 citations · 36 across the 23 of their papers we have counts for
24 papers
Performance Comparison of Graph Representations Which Support Dynamic Graph Updates
Subhajit Sahu
Research in graph-structured data has grown rapidly due to graphs' ability to represent complex real-world information and capture intricate relationships, particularly as many rea…
CPU vs. GPU for Community Detection: Performance Insights from GVE-Louvain and -Louvain
Subhajit Sahu
Community detection involves identifying natural divisions in networks, a crucial task for many large-scale applications. This report presents GVE-Louvain, one of the most efficien…
Memory Efficient GPU-based Label Propagation Algorithm (LPA) for Community Detection on Large Graphs
Subhajit Sahu
Community detection involves grouping nodes in a graph with dense connections within groups, than between them. We previously proposed efficient multicore (GVE-LPA) and GPU-based (…
-LPA: Fast GPU-based Label Propagation Algorithm (LPA) for Community Detection
Subhajit Sahu
Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions are critical in a number of applicatio…
Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches
Subhajit Sahu
Community detection in graphs identifies groups of nodes with denser connections within the groups than between them, and while existing studies often focus on optimizing detection…
Heuristic-based Dynamic Leiden Algorithm for Efficient Tracking of Communities on Evolving Graphs
Subhajit Sahu
Community detection, or clustering, identifies groups of nodes in a graph that are more densely connected to each other than to the rest of the network. Given the size and dynamic…
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…
A Starting Point for Dynamic Community Detection with Leiden Algorithm
Subhajit Sahu
Real-world graphs often evolve over time, making community or cluster detection a crucial task. In this technical report, we extend three dynamic approaches - Naive-dynamic (ND), D…
Efficient GPU Implementation of Static and Incrementally Expanding DF-P PageRank for Dynamic Graphs
Subhajit Sahu
PageRank is a widely used centrality measure that "ranks" vertices in a graph by considering the connections and their importance. In this report, we first introduce one of the mos…
DF Louvain: Fast Incrementally Expanding Approach for Community Detection on Dynamic Graphs
Subhajit Sahu
Community detection is the problem of recognizing natural divisions in networks. A relevant challenge in this problem is to find communities on rapidly evolving graphs. In this rep…
GSL-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection with no Internally-Disconnected Communities
Subhajit Sahu
Community detection is the problem of identifying tightly connected clusters of nodes within a network. Efficient parallel algorithms for this play a crucial role in various applic…
An Approach for Addressing Internally-Disconnected Communities in Louvain Algorithm
Subhajit Sahu
Community detection is the problem of identifying densely connected clusters within a network. While the Louvain algorithm is commonly used for this task, it can produce internally…
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…
An Incrementally Expanding Approach for Updating PageRank on Dynamic Graphs
Subhajit Sahu
PageRank is a popular centrality metric that assigns importance to the vertices of a graph based on its neighbors and their score. Efficient parallel algorithms for updating PageRa…
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…
GVE-Louvain: Fast Louvain 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…
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…
Heuristics for Inequality minimization in PageRank values
Subhajit Sahu
PageRank is a widely used algorithm for ranking webpages and plays a significant role in determining web traffic. This study employs the Gini coefficient, a measure of income/wealt…
Enhancing Efficiency in Parallel Louvain Algorithm for Community Detection
Subhajit Sahu
Community detection is a key aspect of network analysis, as it allows for the identification of groups and patterns within a network. With the ever-increasing size of networks, it…
Selecting a suitable Parallel Label-propagation based algorithm for Disjoint Community Detection
Subhajit Sahu
Community detection is an essential task in network analysis as it helps identify groups and patterns within a network. High-speed community detection algorithms are necessary to a…
Effect of stepwise adjustment of Damping factor upon PageRank
Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee
The effect of adjusting damping factor α, from a small initial value α0 to the final desired αf value, upon then iterations needed for PageRank computation is observed. Adjustment…
Adjusting PageRank parameters and Comparing results
Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee
The effect of adjusting damping factor α and tolerance τ on iterations needed for PageRank computation is studied here. Relative performance of PageRank computation with L1, L2, an…