Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On the minimum diameter spanning tree problem
Information Processing Letters
How to swap a failing edge of a single source shortest paths tree
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Distributed computation for swapping a failing edge
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Computing all the best swap edges distributively
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Given a spanning tree T of a 2-edge connected, weighted graph G, a swap edge for a failing edge e in T is an edge e′ of G reconnecting the two subtrees of T created bythe removal of e. A best swap edge is a swap edge enjoying the additional property of optimizing the swap, with respect to a given objective function. If the spanning tree is a single source shortest paths tree rooted in a node r, say S(r), it has been shown that there exist efficient algorithms for finding a best swap edge, for each edge e in S(r) and with respect to several objective functions. These algorithms are efficient both in terms of the functionalities of the trees obtained as a consequence of the swaps, and of the time spent to compute them. In this paper we propose an extensive experimental analysis of the above algorithms, showing that their actual behaviour is much better than what it was expected from the theoretical analysis.