Experimental analysis of algorithms for updating minimum spanning trees on graphs subject to changes on edge weights

Authors:
Celso C. Ribeiro;Rodrigo F. Toso
Affiliations:
Institute of Computing, Universidade Federal Fluminense, Niterói, RJ, Brazil;Institute of Computing, Universidade Federal Fluminense, Niterói, RJ, Brazil
Venue:
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Year:
2007

Citing 11
Cited 4

A data structure for dynamic trees

Journal of Computer and System Sciences
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
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
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 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 Dynamic Minimum Spanning Trees: An Experimental Study

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Implementations and experimental studies of dynamic graph algorithms

Experimental algorithmics
Self-adjusting top trees

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A hybrid genetic algorithm for the weight setting problem in OSPF-IS-IS routing

Networks

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of maintaining a minimum spanning tree of a dynamically changing graph, subject to changes on edge weights. We propose an on-line fully-dynamic algorithm that runs in time O(|E|) when the easy-to-implement DRD-trees data structure for dynamic trees is used. Numerical experiments illustrate the efficiency of the approach.