Maintaining Dynamic Minimum Spanning Trees: An Experimental Study [chapter]

Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
2002 Lecture Notes in Computer Science  
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, semirandom and worst-case inputs previously considered in the
more » ... ure together with inputs arising from real-world applications (e.g., a graph of the Internet Autonomous Systems).
doi:10.1007/3-540-45643-0_9 fatcat:szax3vv2sfaztpxdpjqbmohxsi