Pages that link to "Item:Q5009785"
From MaRDI portal
The following pages link to Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785):
Displaying 9 items.
- Separating sublinear time computations by approximate diameter (Q849140) (← links)
- A note on hardness of diameter approximation (Q1705693) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- (Q4414499) (← links)
- Approximating the Stretch Factor of Euclidean Graphs (Q4507380) (← links)
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs (Q4575605) (← 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)
- Approximating all-points furthest pairs and maximum spanning trees in metric spaces (Q6569899) (← links)