Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs

DOI10.1137/1.9781611974782.29zbMath1410.68279OpenAlexW4250448245MaRDI QIDQ4575766

Shiri Chechik, Aaron Bernstein

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://doi.org/10.1137/1.9781611974782.29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs

This page was built for publication: Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs