1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DC2019★ 1 cited
More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm
Michael Kainer, Jesper Larsson Träff
Dijkstra's algorithm for the Single-Source Shortest Path (SSSP) problem is notoriously hard to parallelize in depth, being the number of vertices in the input graph, wit…
cs.DS2014
An improved, easily computable combinatorial lower bound for weighted graph bipartitioning
Jesper Larsson Träff, Martin Wimmer
There has recently been much progress on exact algorithms for the (un)weighted graph (bi)partitioning problem using branch-and-bound and related methods. In this note we present an…