All-Hops Shortest Paths

Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu +1

Let $G=(V,E,w)$ be a weighted directed graph without negative cycles. For two vertices $s,t\in V$, we let $d_{\le h}(s,t)$ be the minimum, according to the weight function $w$, of…