Pages that link to "Item:Q5230295"
From MaRDI portal
The following pages link to Towards tight approximation bounds for graph diameter and eccentricities (Q5230295):
Displaying 15 items.
- Graph spanners: a tutorial review (Q2026289) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← 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)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- (Q5091161) (← links)
- (Q5091199) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)