Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths

Bidragets oversatte titel: Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths

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

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

3 Citationer (Scopus)

Bidragets oversatte titel	Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths
Originalsprog	Engelsk
Titel	Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168
Antal sider	24
Publikationsdato	2006
Sider	556-579
Status	Udgivet - 2006
Udgivet eksternt	Ja

Navn	Lecture notes in computer science
Vol/bind	4168
ISSN	0302-9743

Citationsformater

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

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › 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",

}