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.

翻译：图中三角形的列举与计数是网络分析的关键算法核心，广泛应用于社区检测、聚类系数、k-桁架和三角形中心性等任务。我们设计并实现了一种新型串行三角形计数算法，在真实和合成图（如Graph500基准测试及MIT/亚马逊/IEEE图挑战赛中的图）上，其性能与现有最快方法相当。实验采用最新发布的英特尔至强铂金8480+和CPU Max 9480处理器进行测试。