217 citations · 361 across the 9 of their papers we have counts for
1 paper · 1 filter
Zeyu Jing, Markus Meister
Given a directed graph of nodes and edges connecting them, a common problem is to find the shortest path between any two nodes. Here we show that the shortest path distances can be…