Pages that link to "Item:Q6487528"
From MaRDI portal
The following pages link to Reachability and shortest paths in the broadcast CONGEST model (Q6487528):
Displaying 4 items.
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- Approximation of distances and shortest paths in the broadcast congest clique (Q5363797) (← links)
- Distributed planar reachability in nearly optimal time (Q6535037) (← links)