Maintaining Dynamic Minimum Spanning Trees: An Experimental Study

Authors:
Giuseppe Cattaneo;Pompeo Faruolo;Umberto Ferraro Petrillo;Giuseppe F. Italiano
Affiliations:
-;-;-;-
Venue:
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Year:
2002

Citing 24
Cited 9

Worst-case Analysis of Set Union Algorithms

Journal of the ACM (JACM)
A data structure for dynamic trees

Journal of Computer and System Sciences
Introduction to algorithms

Introduction to algorithms
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Maintenance of a minimum spanning forest in a dynamic plane graph

Journal of Algorithms
Separator based sparsification for dynamic planar graph algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved data structures for fully dynamic biconnectivity

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
LEDA: a platform for combinatorial and geometric computing

Communications of the ACM
Randomized dynamic graph algorithms with polylogarithmic time per operation

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An empirical study of dynamic graph algorithms

Journal of Experimental Algorithmics (JEA)
Sparsification—a technique for speeding up dynamic graph algorithms

Journal of the ACM (JACM)
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Experimental analysis of dynamic algorithms for the single source shortest paths problem

Journal of Experimental Algorithmics (JEA)
A fully dynamic algorithm for maintaining the transitive closure

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Average case analysis of dynamic graph algorithms

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Minimum Spanning Trees in Dynamic Graphs

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
An Experimental Study of Dynamic Algorithms for Directed Graphs

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Fully dynamic biconnectivity and transitive closure

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Randomized search trees

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Implementations and experimental studies of dynamic graph algorithms

Experimental algorithmics
Experimental analysis of dynamic all pairs shortest path algorithms

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Highly scalable algorithms for rectilinear and octilinear Steiner trees

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Experimental analysis of dynamic all pairs shortest path algorithms

ACM Transactions on Algorithms (TALG)
An experimental study of algorithms for fully dynamic transitive closure

Journal of Experimental Algorithmics (JEA)
Dynamic trees in practice

Journal of Experimental Algorithmics (JEA)
Maintaining dynamic minimum spanning trees: An experimental study

Discrete Applied Mathematics
Dynamic trees in practice

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Experimental analysis of algorithms for updating minimum spanning trees on graphs subject to changes on edge weights

WEA'07 Proceedings of the 6th international conference on Experimental algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report our findings on an extensive empirical study on several algorithms for maintainingminim um spanningtrees in dynamic graphs. In particular, we have implemented and tested a variant of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson's algorithm, and compared them to 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.