A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs

Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Fingerprint

Dive into the research topics of 'A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science