Pages that link to "Item:Q4228283"
From MaRDI portal
The following pages link to Time–Work Tradeoffs of the Single-Source Shortest Paths Problem (Q4228283):
Displaying 12 items.
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Simpler computation of single-source shortest paths in linear average time (Q2432528) (← links)
- Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time (Q4216148) (← links)
- Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q4406310) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- (Q5092347) (← links)
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)
- (Q5240196) (← links)
- Computing single source shortest paths using single-objective fitness (Q5276063) (← links)