An experimental study of external memory algorithms for connected components

We empirically investigate algorithms for solving Connected Components in the external memory model. In particular, we study whether the randomized O(Sort(E)) algorithm by Karger, Klein, and Tarjan can be implemented to 
We empirically investigate algorithms for solving Connected Components in the external memory model. In particular, we study whether the randomized O(Sort(E)) algorithm by Karger, Klein, and Tarjan can be implemented to compete with practically promising and simpler algorithms having only slightly worse theoretical cost, namely Borůvka’s algorithm and the algorithm by Sibeyn and collaborators. For all algorithms, we develop and test a number of tuning options. Our experiments are executed on a large set of different graph classes including random graphs, grids, geometric graphs, and hyperbolic graphs. Among our findings are: The Sibeyn algorithm is a very strong contender due to its simplicity and due to an added degree of freedom in its internal workings when used in the Connected Components setting. With the right tunings, the Karger-Klein-Tarjan algorithm can be implemented to be competitive in many cases. Higher graph density seems to benefit Karger-Klein-Tarjan relative to Sibeyn. Borůvka’s algorithm is not competitive with the two others.
show moreshow less

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

    Share in Twitter Search Google Scholar
Metadaten
Author:Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran
URN:urn:nbn:de:hebis:30:3-589660
DOI:http://dx.doi.org/10.4230/LIPIcs.SEA.2021.23
ISBN:978-3-95977-185-6
ISSN:1868-8969
Parent Title (English):Leibniz International Proceedings in Informatics (LIPIcs) ; 190, 23, 19th International Symposium on Experimental Algorithms (SEA 2021)
Document Type:Conference Proceeding
Language:English
Date of Publication (online):2021/05/31
Date of first Publication:2021/05/31
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2021/10/11
Tag:Connected Components; Experimental Evaluation; External Memory; Graph Algorithms; Randomization
Issue:23
Pagenumber:23
First Page:1
Last Page:23
Institutes:Informatik
Dewey Decimal Classification:004 Datenverarbeitung; Informatik
Sammlungen:Universitätspublikationen
Licence (German):License LogoCreative Commons - Namensnennung 4.0

$Rev: 11761 $