The following pages link to (Q4250790):
Displaying 5 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- A distributed algorithm for constructing a minimum diameter spanning tree (Q1881298) (← links)
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325) (← links)
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages (Q4349697) (← links)
- Distributed exact weighted all-pairs shortest paths in near-linear time (Q5212774) (← links)