55 citations · 55 across the 1 of their papers we have counts for
1 paper
Léon R. Planken, Mathijs M. de Weerdt, Roman P. J. van der Krogt
We present two new and efficient algorithms for computing all-pairs shortest paths. The algorithms operate on directed graphs with real (possibly negative) weights. They make use o…