Distance sensitivity oracles with subcubic preprocessing time and fast query time

DOI10.1145/3357713.3384253zbMath1474.68213OpenAlexW3034924176MaRDI QIDQ5145020

Shiri Chechik, Sarel Cohen

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3357713.3384253

zbMATH Keywords

shortest pathsfault-tolerancereplacement pathsdistance sensitivity oracles

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (4)

Mincut sensitivity data structures for the insertion of an edge ⋮ Compact distance oracles with large sensitivity and low stretch ⋮ Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. ⋮ Improved distance sensitivity oracles with subcubic preprocessing time

This page was built for publication: Distance sensitivity oracles with subcubic preprocessing time and fast query time