Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels

DOI10.1145/2213977.2214084zbMath1286.05030OpenAlexW2017675289MaRDI QIDQ5415545

Ittai Abraham, Cyril Gavoille, Shiri Chechik

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2213977.2214084

zbMATH Keywords

planar graphsdynamic algorithmsdistance oracle

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (10)

Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Unnamed Item ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Efficient dynamic approximate distance oracles for vertex-labeled planar graphs ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Unnamed Item ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Fault-tolerant distance labeling for planar graphs

This page was built for publication: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels