Proceedings ArticleDOI
Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components
Chirayu Anant Haryan,Gummadi S. Ramakrishna,Kishore Kothapalli,Dip Sankar Banerjee +3 more
- pp 1195-1205
TLDR
This paper designs shared-memory parallel algorithms that obtain the biconnected components of a graph subsequent to the insertion or deletion of a batch of edges and indicates that these algorithms outperform parallel state-of-the-art static algorithms.Citations
More filters
Journal ArticleDOI
Enhancing Efficiency in Parallel Louvain Algorithm for Community Detection
TL;DR: Louvain this paper is a modularity-based greedy algorithm that divides a network into disconnected communities better over several iterations, but it can be at least a factor of ten slower than community discovery techniques that rely on label propagation.
Journal ArticleDOI
Selecting a suitable Parallel Label-propagation based algorithm for Disjoint Community Detection
TL;DR: In this article , the authors investigate the performance and accuracy of three label-propagation-based static community discovery techniques, namely, RAK, COPRA, and SLPA.
Journal ArticleDOI
On Querying Connected Components in Large Temporal Graphs
TL;DR: In this paper , the concepts of window-CCs and window-SCCs on undirected and directed temporal graphs, respectively, were introduced and several efficient index-based query solutions were developed.
References
More filters
Journal ArticleDOI
The university of Florida sparse matrix collection
Timothy A. Davis,Yifan Hu +1 more
TL;DR: The University of Florida Sparse Matrix Collection, a large and actively growing set of sparse matrices that arise in real applications, is described and a new multilevel coarsening scheme is proposed to facilitate this task.
Journal ArticleDOI
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Monika Henzinger,Valerie King +1 more
TL;DR: The first fully dynamic algorithms that maintain connectivity, bipartiteness, and approximate minimum spanning trees in polylogarithmic time per edge insertion or deletion are presented.
Journal ArticleDOI
Sparsification—a technique for speeding up dynamic graph algorithms
TL;DR: In this article, the authors provide data strutures that maintain a graph as edges are inserted and deleted, and keep track of the following properties with the following times: minimum spanning forests, graph connectivity, graph 2-edge connectivity, and bipartiteness in timeO(n 1/2) per change; 3-edge connections, in time O(n 2/3) per insertion; 4-edge connection, in O(na(n)) per insertion.
Proceedings ArticleDOI
A Fast Algorithm for Streaming Betweenness Centrality
TL;DR: This work gives a novel algorithm that reduces computation for the insertion of an edge into the graph, the first algorithm for the computation of betweenness centrality in a streaming graph.
Proceedings ArticleDOI
A fast GPU algorithm for graph connectivity
TL;DR: This work presents a GPU-optimized implementation for finding the connected components of a given graph, and tries to minimize the impact of irregularity, both at the data level and functional level.
Related Papers (5)
Load Balanced Optimisation of Virtualised Algorithms for Implementation on Massively Parallel SIMD Architectures
C. A. Farrell,D. Kieronska +1 more