Exact Distance Oracles for Planar Graphs with Failing Vertices

DOI10.1137/1.9781611975482.127zbMath1422.68046arXiv1807.05968OpenAlexW4232322645MaRDI QIDQ5236314

Benjamin Tebeka, Panagiotis Charalampopoulos, Shay Mozes

Publication date: 15 October 2019

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

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

zbMATH Keywords

planar graphsshortest pathsVoronoi diagramsdistance oracles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Data structures (68P05) Computer science (68-XX)

Related Items (4)

Fault-tolerant distance labeling for planar graphs ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees ⋮ Fault-tolerant distance labeling for planar graphs

This page was built for publication: Exact Distance Oracles for Planar Graphs with Failing Vertices