The following pages link to STACS 2005 (Q5710717):
Displaying 15 items.
- On the all-pairs-shortest-path problem in unweighted undirected graphs. (Q960518) (← 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)
- A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time (Q1944395) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
- All-pairs small-stretch paths (Q2729642) (← links)
- External-memory exact and approximate all-pairs shortest-paths in undirected graphs (Q2921735) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- (Q4636506) (← links)
- (Q4694733) (← links)
- (Q4887753) (← links)
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← links)
