109 citations · 196 across the 30 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 4 cited
FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence
Yongzhe Zhang, Ariful Azad, Zhenjiang Hu
This paper presents a new distributed-memory algorithm called FastSV for finding connected components in an undirected graph. Our algorithm simplifies the classic Shiloach-Vishkin…
cs.DC2019★ 3 cited
A GraphBLAS Approach for Subgraph Counting
Langshi Chen, Jiayu Li, Ariful Azad +7
Subgraph counting aims to count the occurrences of a subgraph template T in a given network G. The basic problem of computing structural properties such as counting triangles and o…