TY - CONF
A1 - Brodal, Gerth Stølting
A1 - Fagerberg, Rolf
A1 - Hammer, David
A1 - Meyer, Ulrich
A1 - Penschuck, Manuel
A1 - Tran, Hung
T1 - An experimental study of external memory algorithms for connected components
T2 - Leibniz International Proceedings in Informatics (LIPIcs) ; 190, 23, 19th International Symposium on Experimental Algorithms (SEA 2021)
N2 - 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.
KW - Connected Components
KW - Experimental Evaluation
KW - External Memory
KW - Graph Algorithms
KW - Randomization
Y1 - 2021
UR - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/58966
UR - https://nbn-resolving.org/urn:nbn:de:hebis:30:3-589660
SN - 978-3-95977-185-6
SN - 1868-8969
IS - 23
SP - 1
EP - 23
ER -