Pages that link to "Item:Q5297139"
From MaRDI portal
The following pages link to A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139):
Displaying 17 items.
- On dynamic shortest paths problems (Q639278) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- New pairwise spanners (Q1693988) (← links)
- Relaxed spanners for directed disk graphs (Q1939674) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- (Q5090437) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- (Q5090928) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- (Q6065466) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
