Pages that link to "Item:Q4575604"
From MaRDI portal
The following pages link to New Bounds for Approximating Extremal Distances in Undirected Graphs (Q4575604):
Displaying 10 items.
- A note on hardness of diameter approximation (Q1705693) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- (Q5002674) (← 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)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
- (Q5091161) (← links)
- (Q5091199) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
