Engineering a Distributed-Memory Triangle Counting Algorithm

Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs using massively parallel distributed-memory machines. Unsurprisingly, the main issue is to reduce communication between...

Full description

Bibliographic Details

Published in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium pp. 702 - 712
Main Authors:	Sanders, Peter, Uhl, Tim Niklas
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2023
Subjects:	clustering coefficient Distributed processing distributed-memory algorithm graph analysis Memory management MPI Program processors Routing Task analysis triangle counting
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!