Sciweavers

Share
ESA
2000
Springer

Maintaining a Minimum Spanning Tree Under Transient Node Failures

10 years 10 months ago
Maintaining a Minimum Spanning Tree Under Transient Node Failures
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
Enrico Nardelli, Guido Proietti, Peter Widmayer
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where ESA
Authors Enrico Nardelli, Guido Proietti, Peter Widmayer
Comments (0)
books