Worst-Case Update Times for Fully-Dynamic All-Pairs Shortest Paths

65 Citations (Scopus)

Translated title of the contribution	Worst-Case Update Times for Fully-Dynamic All-Pairs Shortest Paths
Original language	English
Title of host publication	Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC)
Number of pages	8
Publisher	Association for Computing Machinery
Publication date	2005
Pages	112-119
DOIs	https://doi.org/10.1145/1060590.1060607
Publication status	Published - 2005
Externally published	Yes

Access to Document

@inproceedings{871cddc5bde942ec8e31b9384807f1e4,

title = "Worst-Case Update Times for Fully-Dynamic All-Pairs Shortest Paths",

author = "Mikkel Thorup",

year = "2005",

doi = "10.1145/1060590.1060607",

language = "English",

pages = "112--119",

booktitle = "Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC)",

publisher = "Association for Computing Machinery",

}