Dynamically Maintaining Shortest Path Trees under Batches of Updates

Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti. Dynamically Maintaining Shortest Path Trees under Batches of Updates. In Thomas Moscibroda, Adele A. Rescigno, editors, Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers. Volume 8179 of Lecture Notes in Computer Science, pages 286-297, Springer, 2013. [doi]

Abstract

Abstract is missing.