Abstract. In network communication systems, frequently messages are routed along a minimum diameter spanning tree (MDST) of the network, to minimize the maximum delay in delivering a message. When a transient edge failure occurs, it is important to choose a temporary replacement edge which minimizes the diameter of the new spanning tree. Such an optimal replacement is called the best swap. As a natural extension, the all-best-swaps (ABS) problem is the problem of finding the best swap for every edge of the MDST. Given a weighted graph G = (V, E), where |V | = n and |E| = m, we solve the ABS problem in O(n √ m) time and O(m + n) space, thus improving previous bounds for m = o(n 2 ).
The problem of finding a best swap edge for each edge in T can be solved in O(n √ m) time and O(m) space REF .
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
Journal of Graph Algorithms and Applications
Mathematics Computer Science