On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs

DOI10.1137/1.9781611974331.ch53zbMath1410.68266OpenAlexW4235118266MaRDI QIDQ4575632

Andrew V. Goldberg, Ittai Abraham, Daniel Delling, Shiri Chechik, Renato F. Werneck

Publication date: 16 July 2018

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

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch53

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Related Items

As Time Goes By: Reflections on Treewidth for Temporal Graphs, Unnamed Item, Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs., Efficient dynamic approximate distance oracles for vertex-labeled planar graphs, Unnamed Item, Single-source shortest paths and strong connectivity in dynamic planar graphs