11 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 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…
-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…
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…
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…