collaborators

1 paper

cs.DS2025

Algorithm Engineering of SSSP With Negative Edge Weights

Alejandro Cassis, Andreas Karrenbauer, André Nusser +1

Computing shortest paths is one of the most fundamental algorithmic graph problems. It is known since decades that this problem can be solved in near-linear time if all weights are…