1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DC2025
Designing Parallel Algorithms for Community Detection using Arachne
Fuhuan Li, Zhihui Du, David A. Bader
The rise of graph data in various fields calls for efficient and scalable community detection algorithms. In this paper, we present parallel implementations of two widely used algo…
cs.DS2024★ 1 cited
Cover Edge-Based Novel Triangle Counting
David A. Bader, Fuhuan Li, Zhihui Du +8
Listing and counting triangles in graphs is a key algorithmic kernel for network analyses, including community detection, clustering coefficients, k-trusses, and triangle centralit…
cs.DC2023
Contour Algorithm for Connectivity
Zhihui Du, Oliver Alvarado Rodriguez, Fuhuan Li +2
Finding connected components in a graph is a fundamental problem in graph analysis. In this work, we present a novel minimum-mapping based Contour algorithm to efficiently solve th…