Pages that link to "Item:Q2817594"
From MaRDI portal
The following pages link to Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q2817594):
Displaying 4 items.
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- Randomized parallel algorithms (Q6560203) (← links)
