Login / Signup
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures.
Enrico Nardelli
Guido Proietti
Peter Widmayer
Published in:
J. Graph Algorithms Appl. (2001)
Keyphrases
</>
spanning tree
edge disjoint
minimum spanning trees
undirected graph
weighted graph
minimum cost
minimum total cost
minimum spanning tree
edge weights
minimum weight
steady state
edge detection
edge detector
edge information
decision trees
strongly connected
root node
maximum distance
lower bound