Maintaining dynamic minimum spanning trees: An experimental study

https://doi.org/10.1016/j.dam.2009.10.005Get rights and content
Under an Elsevier user license
open archive

Abstract

We report our findings on an extensive empirical study on the performance of several algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we have implemented and tested several variants of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson’s algorithm, and other (less sophisticated) dynamic algorithms. In our experiments, we considered as test sets several random, semi-random and worst-case inputs previously considered in the literature together with inputs arising from real-world applications (e.g., a graph of the Internet Autonomous Systems).

Keywords

Experimental analysis
Minimum spanning tree algorithms
Dynamic graphs

Cited by (0)

This work has been partially supported by MIUR, the Italian Ministry for University and Research, under Project MAINSTREAM “Algorithms for Massive Information Systems and Data Streams” and by the University of Salerno under project “Sicurezza Dati, Computazione Distribuita e Compressione Dati”. A preliminary version of this paper appeared in G. Cattaneo, P. Faruolo, U. Ferraro Petrillo, G.F. Italiano (2002) [10].