Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Bidragets oversatte titelDoes Path Cleaning Help in Dynamic All-Pairs Shortest Paths
OriginalsprogEngelsk
TitelProceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168
Antal sider24
Publikationsdato2006
Sider556-579
StatusUdgivet - 2006
Eksternt udgivetJa
NavnLecture notes in computer science
Vol/bind4168
ISSN0302-9743

ID: 98324357