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

DOI10.1007/11841036_65MaRDI QIDQ5449576zbMATH OpenOpenAlexFDO

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

Publication date 11 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11841036_65

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Programming involving graphs or networks (90C35)

Recommendations

• Experimental analysis of dynamic all pairs shortest path algorithms
• scientific article; zbMATH DE number 6469167
• A new approach to dynamic all pairs shortest paths
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• A new approach to dynamic all pairs shortest paths

Cited in

(2)

• Experimental analysis of dynamic all pairs shortest path algorithms
• Maintaining dynamic minimum spanning trees: an experimental study

This page was built for publication: Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449576)