scientific article; zbMATH DE number 6850343

zbMath1403.68163arXiv1708.01386MaRDI QIDQ4607915

Shay Mozes, Oren Weimann, Paweł Gawrychowski, Christian Wulff-Nilsen

Publication date: 15 March 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Data structures (68P05)

Related Items

Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time ⋮ A substring-substring LCS data structure ⋮ Better distance labeling for unweighted planar graphs ⋮ Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension ⋮ Eccentricity queries and beyond using hub labels ⋮ Unnamed Item ⋮ Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs ⋮ Better distance labeling for unweighted planar graphs ⋮ Shortest-Path Queries in Geometric Networks ⋮ Faster approximate diameter and distance oracles in planar graphs ⋮ The inverse Voronoi problem in graphs. I: Hardness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fault-tolerant distance labeling for planar graphs ⋮ An efficient oracle for counting shortest paths in planar graphs ⋮ Unnamed Item ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Non-crossing shortest paths in undirected unweighted planar graphs in linear time ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time ⋮ Fault-tolerant distance labeling for planar graphs ⋮ An efficient oracle for counting shortest paths in planar graphs

This page was built for publication: