Fully dynamic all-pairs shortest paths with worst-case update-time revisited
From MaRDI portal
Publication:4575765
DOI10.1137/1.9781611974782.28zbMath1410.68267arXiv1607.05132OpenAlexW2949477394MaRDI QIDQ4575765
Shiri Chechik, Sebastian Krinninger, Ittai Abraham
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.05132
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Randomized algorithms (68W20)
Related Items (7)
On the robustness of the metric dimension of grid graphs to adding a single edge ⋮ Unnamed Item ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Improved Dynamic Graph Coloring ⋮ Fully Dynamic Connectivity Oracles under General Vertex Updates
This page was built for publication: Fully dynamic all-pairs shortest paths with worst-case update-time revisited
