1 citations · 2 across the 6 of their papers we have counts for
6 papers
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…
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…
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…
Property Graphs in Arachne
Oliver Alvarado Rodriguez, Fernando Vera Buschmann, Zhihui Du +1
Analyzing large-scale graphs poses challenges due to their increasing size and the demand for interactive and user-friendly analytics tools. These graphs arise from various domains…
Parallel Longest Common SubSequence Analysis In Chapel
Soroush Vahidi, Baruch Schieber, Zhihui Du +1
One of the most critical problems in the field of string algorithms is the longest common subsequence problem (LCS). The problem is NP-hard for an arbitrary number of strings but c…
Triangle Counting Through Cover-Edges
David A. Bader, Fuhuan Li, Anya Ganeshan +4
Counting and finding triangles in graphs is often used in real-world analytics to characterize cohesiveness and identify communities in graphs. In this paper, we propose the novel…