Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths

DOI10.1137/1.9781611977554.CH4MaRDI QIDQ6538529FDOQ6538529

Authors: Shiri Chechik, Tianyi Zhang 

Publication date: 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths

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