Publication Details
Title: Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
Author: T. Friedrich and N. Hebbinghaus
Group: Algorithms
Date: December 2008
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/2008ISAAC_APSP.pdf
Acknowledgements:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship.
Bibliographic Information:
Proceedings of International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, pp. 693-704
Bibliographic Reference:
T. Friedrich and N. Hebbinghaus. Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. Proceedings of International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, pp. 693-704, December 2008
Author: T. Friedrich and N. Hebbinghaus
Group: Algorithms
Date: December 2008
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/2008ISAAC_APSP.pdf
Acknowledgements:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship.
Bibliographic Information:
Proceedings of International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, pp. 693-704
Bibliographic Reference:
T. Friedrich and N. Hebbinghaus. Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. Proceedings of International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, pp. 693-704, December 2008