Pages that link to "Item:Q2064057"
From MaRDI portal
The following pages link to Fast approximate shortest paths in the congested clique (Q2064057):
Displaying 4 items.
- Fast partial distance estimation and applications (Q2796252) (← links)
- The shortest path with at most / nodes in each of the series/parallel clusters (Q4894863) (← links)
- Congested Clique Algorithms for the Minimum Cut Problem (Q5197700) (← links)
- Approximation of distances and shortest paths in the broadcast congest clique (Q5363797) (← links)