Triangle Counting Through Cover-Edges
Document Type
Conference Proceeding
Publication Date
1-1-2023
Abstract
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 concept of a cover-edge set that can be used to find triangles more efficiently. We use a breadth-first search (BFS) to quickly generate a compact cover-edge set. Novel sequential and parallel triangle counting algorithms are presented that employ cover-edge sets. The sequential algorithm avoids unnecessary triangle-checking operations, and the parallel algorithm is communication-efficient. The parallel algorithm can asymptotically reduce communication on massive graphs such as from real social networks and synthetic graphs from the Graph500 Benchmark. In our estimate from massive-scale Graph500 graphs, our new parallel algorithm can reduce the communication on a scale 36 graph by 1156x and on a scale 42 graph by 2368x.
Identifier
85173007819 (Scopus)
ISBN
[9798350308600]
Publication Title
2023 IEEE High Performance Extreme Computing Conference Hpec 2023
External Full Text Location
https://doi.org/10.1109/HPEC58863.2023.10363465
Grant
CCF-2109988
Fund Ref
National Science Foundation
Recommended Citation
Bader, David A.; Li, Fuhuan; Ganeshan, Anya; Gundogdu, Ahmet; Lew, Jason; Rodriguez, Oliver Alvarado; and Du, Zhihui, "Triangle Counting Through Cover-Edges" (2023). Faculty Publications. 2281.
https://digitalcommons.njit.edu/fac_pubs/2281
