Improved work span tradeoff for single source reachability and approximate shortest paths

14/07/2020

Improved work span tradeoff for single source reachability and approximate shortest paths

Nairen Cao, Jeremy T. Fineman, Katina Russell

Keywords: shortest paths, parallel algorithm, shortcuts, reachability

Abstract: This brief announcement presents parallel algorithms with a tradeoff between work and span for single source reachability and approximate shortest paths on directed graphs. Both algorithms have O(mρ2 + nρ4) work and achieve n1/2+ o(1)/ρ span for all ρ ∈ [1,√n].

SPAA

This is an embedded video. Talk and the respective paper are published at SPAA 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment

no comments yet