Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419571 | Discrete Applied Mathematics | 2010 | 22 Pages |
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
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
G. Cattaneo, P. Faruolo, U. Ferraro Petrillo, G.F. Italiano,