Maintaining a Minimum Spanning Tree Under Transient Node Failures

Authors:
Enrico Nardelli;Guido Proietti;Peter Widmayer
Affiliations:
-;-;-
Venue:
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Year:
2000

Citing 8
Cited 1

Self adjusting heaps

SIAM Journal on Computing
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
Offline algorithms for dynamic minimum spanning tree problems

Journal of Algorithms
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
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
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

Efficient management of transient station failures in linear radio communication networks with bases

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a 2-node connected, undirected graph G = (V,E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V,ET) of G, we study the problem of finding, for every node v ∈ V, the MST of G - v =(V\{v},E\Ev), where Ev is the set of edges incident to v in G. We show that this problem can be solved in O(min(m ċ α (n, n), m+n log n)) time and O(m) space. Our solution improves on the previously known O(m log n) time bound.