Pages that link to "Item:Q3603556"
From MaRDI portal
The following pages link to Faster Approximation of Distances in Graphs (Q3603556):
Displaying 9 items.
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- (Q5091199) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
