Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree

Flocchini, P., Enriques, A.M., Pagli, L., Prencipe, G., Santoro, N. (2004). Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_14