A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
From MaRDI portal
Publication:5384041
DOI10.1137/1.9781611973402.79zbMath1421.68231OpenAlexW4256186298MaRDI QIDQ5384041
Sebastian Krinninger, Danupon Nanongkai, Monika R. Henzinger
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.79
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Data structures (68P05) Approximation algorithms (68W25)
Related Items (3)
Unnamed Item ⋮ Incremental single-source shortest paths in digraphs with arbitrary positive arc weights ⋮ Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
This page was built for publication: A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
