A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree

Davide Bilò, Luciano Gualà, Guido Proietti. A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. In Hans L. Bodlaender, Giuseppe F. Italiano, editors, Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Volume 8125 of Lecture Notes in Computer Science, pages 157-168, Springer, 2013. [doi]

Authors

Davide Bilò

This author has not been identified. Look up 'Davide Bilò' in Google

Luciano Gualà

This author has not been identified. Look up 'Luciano Gualà' in Google

Guido Proietti

This author has not been identified. Look up 'Guido Proietti' in Google