Pages that link to "Item:Q5146902"
From MaRDI portal
The following pages link to Diameter computation on <i>H</i>-minor free graphs and graphs of bounded (distance) VC-dimension (Q5146902):
Displaying 10 items.
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
