Pages that link to "Item:Q5919900"
From MaRDI portal
The following pages link to Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900):
Displayed 11 items.
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Q5090437) (← 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)