Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths

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

Translated title of the contributionDoes Path Cleaning Help in Dynamic All-Pairs Shortest Paths
Original languageEnglish
Title of host publicationProceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168
Number of pages24
Publication date2006
Pages556-579
Publication statusPublished - 2006
Externally publishedYes
SeriesLecture notes in computer science
Volume4168
ISSN0302-9743

ID: 98324357