Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
From MaRDI portal
Publication:5146902
Cited in
(19)- Packing and covering balls in graphs excluding a minor
- Eccentricity queries and beyond using hub labels
- Beyond Helly graphs: the diameter problem on absolute retracts
- Distance problems within Helly graphs and \(k\)-Helly graphs
- Fast diameter computation within split graphs
- Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Parameterized complexity of diameter
- The diameter of AT‐free graphs
- A story of diameter, radius, and (almost) Helly property
- _i-metric graphs: radius, diameter and all eccentricities
- Parameterized complexity of streaming diameter and connectivity problems
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- An optimal sparsification lemma for low-crossing matchings and its applications to discrepancy and approximations
- The complexity of diameter on H-free graphs
- Parameterized complexity of streaming diameter and connectivity problems
- Obstructions to faster diameter computation: asteroidal sets
- The complexity of diameter on \(H\)-free graphs
- Better diameter algorithms for bounded VC-dimension graphs and geometric intersection graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
This page was built for publication: Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146902)
