18 citations · 36 across the 23 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…