scientific article; zbMATH DE number 6850342

zbMath1403.68162arXiv1704.02793MaRDI QIDQ4607914

Shay Mozes, Oren Weimann, Paweł Gawrychowski, Haim Kaplan, Micha Sharir

Publication date: 15 March 2018

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (11)

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly 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 ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ Unnamed Item ⋮ Faster approximate diameter and distance oracles in planar graphs ⋮ The inverse Voronoi problem in graphs. I: Hardness ⋮ Unnamed Item ⋮ Faster Approximate Diameter and Distance Oracles in Planar Graphs

This page was built for publication: