13 papers · 1 filter
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…
-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…
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 (…
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…