1 paper
Adam Karczmarz, Wojciech Nadara, Marek SokoÅowski
In this paper, we show new strongly polynomial work-depth tradeoffs for computing single-source shortest paths (SSSP) in non-negatively weighted directed graphs in parallel. Most i…