Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?

Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup. Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?. In Yossi Azar, Thomas Erlebach, editors, Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings. Volume 4168 of Lecture Notes in Computer Science, pages 732-743, Springer, 2006. [doi]

Abstract

Abstract is missing.