"Fast Triangle Counting" by David A. Bader
 

Fast Triangle Counting

Document Type

Conference Proceeding

Publication Date

1-1-2023

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.

Identifier

85182600707 (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.10363539

Grant

CCF-2109988

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS