Maintaining dynamic minimum spanning trees: An experimental study☆
Under an Elsevier user license
open archive
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].
Copyright © 2009 Elsevier B.V. All rights reserved.