[1]
Nardelli, E. et al. 2001. Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. Journal of Graph Algorithms and Applications. 5, 5 (Jan. 2001), 39–57. DOI:https://doi.org/10.7155/jgaa.00039.