The following publications are possibly variants of this publication:
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree SpannerDavide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. isaac 2017: [doi]
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree SpannersDavide Bilò, Kleitos Papadopoulos. isaac 2018: [doi]
- A Faster Computation of All the Best Swap Edges of a Tree SpannerDavide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. sirocco 2015: 239-253 [doi]
- Computing All Best Swaps for Minimum-Stretch Tree SpannersShantanu Das 0001, Beat Gfeller, Peter Widmayer. jgaa, 14(2):287-306, 2010. [doi]
- A Faster Computation of All the Best Swap Edges of a Shortest Paths TreeDavide Bilò, Luciano Gualà, Guido Proietti. algorithmica, 73(3):547-570, 2015. [doi]