Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary

DOI10.1137/1.9781611975994.155OpenAlexW2996765263MaRDI QIDQ5146946

Christian Wulff-Nilsen, Maximilian Probst Gutenberg

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.10821

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time

This page was built for publication: Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary