1 citations · 1 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
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…
cs.DS2023
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…