ConnectIt: a framework for static and incremental parallel graph connectivity algorithms

Connected components is a fundamental kernel in graph applications. The fastest existing multicore algorithms for solving graph connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design choices have been left unexplored. In...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the VLDB Endowment 2020-12, Vol.14 (4), p.653-667
Hauptverfasser:	Dhulipala, Laxman, Hong, Changwan, Shun, Julian
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!