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...

Full description

Bibliographic Details

Published in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium pp. 2 - 12
Main Authors:	Azad, Ariful, Buluc, Aydin
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2019
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!