3 citations · 6 across the 15 of their papers we have counts for
1 paper · 1 filter
Tomasz Kociumaka, Adam Polak
This paper is about the problem of finding a shortest s-t path using at most h edges in edge-weighted graphs. The Bellman--Ford algorithm solves this problem in O(hm) time,…