A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs

DOI10.1137/1.9781611977073.138MaRDI QIDQ6575219zbMATH OpenFDO

Authors Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.138

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs

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