@inproceedings{cb542a6035314dda8719b19dd5f49562,
title = "Fast Triangle Counting",
abstract = "Listing and counting triangles in graphs is a key algorithmic kernel for network analyses including community detection, clustering coefficients, k-trusses, and triangle centrality. We design and implement a new serial algorithm for triangle counting that performs competitively with the fastest previous approaches on both real and synthetic graphs, such as those from the Graph500 Benchmark and the MIT/Amazon/IEEE Graph Challenge. The experimental results use the recently-launched Intel Xeon Platinum 8480+ and CPU Max 9480 processors.",
keywords = "Graph Algorithms, High Performance Data Analytics, Triangle Counting",
author = "Bader, {David A.}",
note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 2023 IEEE High Performance Extreme Computing Conference, HPEC 2023 ; Conference date: 25-09-2023 Through 29-09-2023",
year = "2023",
doi = "10.1109/HPEC58863.2023.10363539",
language = "English (US)",
series = "2023 IEEE High Performance Extreme Computing Conference, HPEC 2023",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2023 IEEE High Performance Extreme Computing Conference, HPEC 2023",
address = "United States",
}