Engineering Massively Parallel MST Algorithms

We develop and extensively evaluate highly scalable distributed-memory algorithms for computing minimum spanning trees (MSTs). At the heart of our solutions is a scalable variant of Borůvka's algorithm. For partitioned graphs with many local edges we improve this with an effective form of contr...

Full description

Bibliographic Details

Published in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium pp. 691 - 701
Main Authors:	Sanders, Peter, Schimek, Matthias
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2023
Subjects:	distributed algorithms Distributed processing Filtering Filtering algorithms graph algorithms Heart minimum spanning tree MPI Partitioning algorithms
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!