Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
From MaRDI portal
Publication:2755058
DOI10.7155/jgaa.00039zbMath0985.68042OpenAlexW2115586117MaRDI QIDQ2755058
Guido Proietti, Enrico Nardelli, Peter Widmayer
Publication date: 7 January 2002
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/49186
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
A Faster Computation of All the Best Swap Edges of a Tree Spanner ⋮ A faster computation of all the best swap edges of a shortest paths tree ⋮ Faster swap edge computation in minimum diameter spanning trees ⋮ Computing all the best swap edges distributively ⋮ Faster Swap Edge Computation in Minimum Diameter Spanning Trees ⋮ Finding best swap edges minimizing the routing cost of a spanning tree ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths
This page was built for publication: Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
