Deterministic decremental single source shortest paths: Beyond the O(mn) bound

Aaron Bernstein, Shiri Chechik

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

49 Scopus citations

Fingerprint

Dive into the research topics of 'Deterministic decremental single source shortest paths: Beyond the O(mn) bound'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Mathematics