Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths

Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup

3 Citations (Scopus)

Translated title of the contribution	Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths
Original language	English
Title of host publication	Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168
Number of pages	24
Publication date	2006
Pages	556-579
Publication status	Published - 2006
Externally published	Yes

Series	Lecture notes in computer science
Volume	4168
ISSN	0302-9743

Cite this

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

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 proceeding › Article in proceedings › Research › peer-review

@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",

}