LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory

Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computat...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium S. 2 - 12
Hauptverfasser:	Azad, Ariful, Buluc, Aydin
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.05.2019
Schlagworte:	Clustering algorithms Computational modeling connected components Forestry graph algorithm GraphBLAS parallel algorithm Partitioning algorithms Phase change random access memory Sparse matrices Vegetation
ISSN:	1530-2075
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!