Pages that link to "Item:Q3523207"
From MaRDI portal
The following pages link to Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time (Q3523207):
Displayed 10 items.
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- (Q5090437) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)