Maintaining dynamic minimum spanning trees: An experimental study

  • Authors:

  • G. Cattaneo;P. Faruolo;U. Ferraro Petrillo;G. F. Italiano

  • Affiliations:

  • Dipartimento di Informatica ed Applicazioni, Universití degli Studi di Salerno, Baronissi (Salerno), Italy;Dipartimento di Informatica ed Applicazioni, Universití degli Studi di Salerno, Baronissi (Salerno), Italy;Dipartimento di Statistica, Probabilití e Statistiche Applicate, "Sapienza" - Universití di Roma, Roma, Italy;Dipartimento di Informatica, Sistemi e Produzione, Universití di Roma "Tor Vergata", Roma, Italy

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2010

Quantified Score

Hi-index 0.04

Visualization

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