Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time Revisited

This item is discarded!DetailsSummary

Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time Revisited

Abraham, I., Chechik, S., & Krinninger, S. (2017). Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time Revisited. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 440-452). Philadelphia, PA: SIAM.

Item is Discarded

Basic (Discarded)

Date of Discard: 2018-12-14

Comment: Dublette

Creators:
Abraham, Ittai¹
Chechik, Shiri¹
Krinninger, Sebastian²

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Dates: Published Online: 2017Date issued: 2017

Files: 0 Files

Locators: 0 Locators

version ID: item_2589685_1

Item State: Discarded

Name of Context: Publications of the MPI for Informatics, Affiliated to: MPI for Informatics