1 citations · 1 across the 4 of their papers we have counts for
4 papers
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…
Fast Triangle Counting
David A. Bader
Listing and counting triangles in graphs is a key algorithmic kernel for network analyses including community detection, clustering coefficients, k-trusses, and triangle centrality…
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…