Improved dynamic algorithms for maintaining approximate shortest paths under deletions

Aaron Bernstein, Liam Roditty

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

63 Scopus citations

Fingerprint

Dive into the research topics of 'Improved dynamic algorithms for maintaining approximate shortest paths under deletions'. Together they form a unique fingerprint.

Keyphrases

Computer Science