1 citations · 1 across the 2 of their papers we have counts for
2 papers
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.DC2022
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…