The following pages link to Computing almost shortest paths (Q5890493):
Displayed 11 items.
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- A parallel bio-inspired shortest path algorithm (Q2218449) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- Approximating average parameters of graphs (Q3514701) (← links)
- Graph Embedding through Random Walk for Shortest Paths Problems (Q3646123) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Improved weighted additive spanners (Q6096039) (← links)