Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
From MaRDI portal
Publication:5146902
DOI10.1137/1.9781611975994.117OpenAlexW3002826123MaRDI QIDQ5146902
Guillaume Ducoffe, Laurent Viennot, Michel A. Habib
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.04385
Related Items (10)
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 ⋮ The diameter of AT‐free graphs ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ Packing and covering balls in graphs excluding a minor ⋮ Parameterized complexity of diameter ⋮ Fast Diameter Computation within Split Graphs
This page was built for publication: Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
