Bootstrapping dynamic distance oracles

DOI10.4230/LIPICS.ESA.2023.50MaRDI QIDQ6657003zbMATH OpenFDO

Authors Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.50

zbMATH Keywords

distance oraclesdynamic graph algorithmsshortest paths

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Approximate suffix-prefix dictionary queries
• Bootstrapping dynamic apsp via sparsification

This page was built for publication: Bootstrapping dynamic distance oracles

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