Pages that link to "Item:Q4962209"
From MaRDI portal
The following pages link to Approximating the Diameter of Planar Graphs in Near Linear Time (Q4962209):
Displaying 14 items.
- Diameter bounds for planar graphs (Q626784) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Computing the Girth of a Planar Graph in O(n logn) Time (Q3638079) (← links)
- Complexity of approximating the oriented diameter of chordal graphs (Q4459604) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- (Q5115792) (← links)
- Succinct enumeration of distant vertex pairs (Q5207511) (← links)
- Fast and Simple Approximation of the Diameter and Radius of a Graph (Q5307536) (← links)
- (Q5485334) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
