Pages that link to "Item:Q5090933"
From MaRDI portal
The following pages link to Congested Clique Algorithms for Graph Spanners (Q5090933):
Displaying 7 items.
- Algebraic methods in the congested clique (Q2010605) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Toward optimal bounds in the congested clique, graph connectivity and MST (Q2796246) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Congested Clique Algorithms for the Minimum Cut Problem (Q5197700) (← links)
- Lessons from the Congested Clique Applied to MapReduce (Q5496156) (← links)