Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Standard

Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths. / Demetrescu, Camil; Faruolo, Pompeo; Italiano, Giuseppe F.; Thorup, Mikkel.

Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168. 2006. p. 556-579 (Lecture notes in computer science, Vol. 4168).

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Harvard

Demetrescu, C, Faruolo, P, Italiano, GF & Thorup, M 2006, Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths. in Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168. Lecture notes in computer science, vol. 4168, pp. 556-579.

APA

Demetrescu, C., Faruolo, P., Italiano, G. F., & Thorup, M. (2006). Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths. In Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168 (pp. 556-579). Lecture notes in computer science Vol. 4168

Vancouver

Demetrescu C, Faruolo P, Italiano GF, Thorup M. Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths. In Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168. 2006. p. 556-579. (Lecture notes in computer science, Vol. 4168).

Author

Demetrescu, Camil ; Faruolo, Pompeo ; Italiano, Giuseppe F. ; Thorup, Mikkel. / Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths. Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168. 2006. pp. 556-579 (Lecture notes in computer science, Vol. 4168).

Bibtex

@inproceedings{767d30cc94a649b48fa7396ad2597b95,
title = "Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths",
author = "Camil Demetrescu and Pompeo Faruolo and Italiano, {Giuseppe F.} and Mikkel Thorup",
year = "2006",
language = "English",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "556--579",
booktitle = "Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168",

}

RIS

TY - GEN

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

AU - Demetrescu, Camil

AU - Faruolo, Pompeo

AU - Italiano, Giuseppe F.

AU - Thorup, Mikkel

PY - 2006

Y1 - 2006

M3 - Article in proceedings

T3 - Lecture notes in computer science

SP - 556

EP - 579

BT - Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168

ER -

ID: 98324357