Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. / Thorup, Mikkel.
Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT). Springer, 2004. p. 384-396 (Lecture notes in computer science, Vol. 3111).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Thorup, M 2004, Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. in Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT). Springer, Lecture notes in computer science, vol. 3111, pp. 384-396. <http://link.springer.com/content/pdf/10.1007%2F978-3-540-27810-8_33.pdf>
APA
Thorup, M. (2004). Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT) (pp. 384-396). Springer. Lecture notes in computer science Vol. 3111 http://link.springer.com/content/pdf/10.1007%2F978-3-540-27810-8_33.pdf
Vancouver
Thorup M. Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT). Springer. 2004. p. 384-396. (Lecture notes in computer science, Vol. 3111).
Author
Bibtex
@inproceedings{8cb7bb21f9ce4cb886332fcbbf96c57c,
title = "Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles",
author = "Mikkel Thorup",
year = "2004",
language = "English",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "384--396",
booktitle = "Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT)",
address = "Switzerland",
}
RIS
TY - GEN
T1 - Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles
AU - Thorup, Mikkel
PY - 2004
Y1 - 2004
M3 - Article in proceedings
T3 - Lecture notes in computer science
SP - 384
EP - 396
BT - Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT)
PB - Springer
ER -
ID: 98321730