Fast Triangle Counting

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2023 IEEE High Performance Extreme Computing Conference, HPEC 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9798350308600
DOIs
StatePublished - 2023
Event2023 IEEE High Performance Extreme Computing Conference, HPEC 2023 - Virtual, Online, United States
Duration: Sep 25 2023Sep 29 2023

Publication series

Name2023 IEEE High Performance Extreme Computing Conference, HPEC 2023

Conference

Conference2023 IEEE High Performance Extreme Computing Conference, HPEC 2023
Country/TerritoryUnited States
CityVirtual, Online
Period9/25/239/29/23

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Modeling and Simulation
  • Artificial Intelligence
  • Computer Science Applications
  • Software
  • Media Technology
  • Computational Mathematics

Keywords

  • Graph Algorithms
  • High Performance Data Analytics
  • Triangle Counting

Fingerprint

Dive into the research topics of 'Fast Triangle Counting'. Together they form a unique fingerprint.

Cite this